arXiv · 2105.11105
A log-log speedup for exponent one-fifth deterministic integer factorisation
Abstract
Building on techniques recently introduced by the second author, and further developed by the first author, we show that a positive integer $N$ may be rigorously and deterministically factored into primes in at most \[ O\left( \frac{N^{1/5} \log^{16/5} N}{(\log\log N)^{3/5}}\right) \] bit operations. This improves on the previous best known result by a factor of $(\log \log N)^{3/5}$.
Explore related subjects
Keep this discovery
David Harvey, Markus Hittmeir. 2021-05-24. A log-log speedup for exponent one-fifth deterministic integer factorisation. https://doi.org/10.1090/mcom%2F3708
Cite the original work for its findings. Save a collection to share your selection of sources.