A deterministic algorithm for integer factorization
Abstract
A deterministic algorithm for factoring n using n1/3+o(1) bit operations is presented. The algorithm tests the divisibility of n by all the integers in a short interval at once, rather than integer by integer as in trial division. The algorithm is implemented.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.