Abstract
The quadratic sieve algorithm is currently the method of choice to factor very large composite numbers with no small factors. In the hands of the Sandia National Laboratories team of James Davis and Diane Holdridge, it has held the record for the largest hard number factore since mid-1983. As of this writing, the largest number it has crackd is the 71 digit number (1071−1)/9, taking 9.5 hours on the Cray XMP computer at Los Alamos, New Mexico. In this paper I shall give some of the history of the algorithm and also describe some of the improvements that habe been suggested for it.
Cite
CITATION STYLE
Pomerance, C. (1985). The quadratic sieve factoring algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 209 LNCS, pp. 169–182). Springer Verlag. https://doi.org/10.1007/3-540-39757-4_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
