arXiv · 1408.2608
A deterministic algorithm for integer factorization
Abstract
A deterministic algorithm for factoring $n$ using $n^{1/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.
Explore related subjects
Keep this discovery
Ghaith A. Hiary. 2014-08-12. A deterministic algorithm for integer factorization. https://arxiv.org/abs/1408.2608
Cite the original work for its findings. Save a collection to share your selection of sources.