arXiv · math/0702227
Note on Integer Factoring Algorithms II
Abstract
This note introduces a new class of integer factoring algorithms. Two versions of this method will be described, deterministic and probabilistic. These algorithms are practical, and can factor large classes of balanced integers N = pq, p < q < 2p in superpolynomial time. Further, an extension of the Fermat factoring method is proposed.
Explore related subjects
Keep this discovery
N. A. Carella. 2007-02-08. Note on Integer Factoring Algorithms II. https://arxiv.org/abs/math/0702227
Cite the original work for its findings. Save a collection to share your selection of sources.