Faster deterministic integer factorization
Abstract
The best known unconditional deterministic complexity bound for computing the prime factorization of an integer N is O(Mint(N(1/4) log N)), where Mint(k) denotes the cost of multiplying k-bit integers. This result is due to Bostan--Gaudry--Schost, following the Pollard--Strassen approach. We show that this bound can be improved by a factor of (log log N)(1/2).
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.