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
supported in part by a grant from the National Science Foundation.
Chapter PDF
Similar content being viewed by others
References
E.R. Canfield, P. Erdös and C. Pomerance, On a problem of Oppenheim concerning “Factorisatio Numerorum”, J. Number Theory, 17 (1983), 1–28.
J.A. Davis and D.B. Holdridge, Factorization using the quadratic sieve algorithm, Sandia Report Sand 83-1346, Sandia National Laboratories, Albuquerque, New Mexico, 1983.
D.E. Knuth, The Art of Computer Programming, vol. 2, Seminumerical Algorithms, 2nd edition, Addison Wesley, Reading, Mass., 1981.
M. Kraitchik, Théorie des Nombres, Tome II, Gauthier-Villars, Paris, 1926.
M. Kraitchik, Recherches sur la Théorie des Nombres, Tome II, Factorisation, Gauthier-Villars, Paris, 1929.
D.H. Lehmer and R.E. Powers, On factoring large numbers, Bull. Amer. Math. Soc. 37 (1931), 770–776.
J.C.P. Miller, On factorisation with a suggested new approach, Math. Comp. 29 (1975), 155–172.
L. Monier, Algorithmes de factorisation d’entiers, thèse de 3e cycle, Orsay (1980).
P. Montgomery, private communication.
M.A. Morrison and J. Brillhart, A method of factoring and the factorization of F7, Math. Comp. 29 (1975), 183–205.
C. Pomerance, Analysis and comparison of some integer factoring algorithms, in Computational Methods in Number Theory, H.W. Lenstra, Jr. and R. Tijdeman, eds., Math. Centrum Tract 154 (1982), 89–139.
C. Pomerance and S.S. Wagstaff, Jr., Implementation of the continued fraction algorithm, Cong. Numerantium 37 (1983), 99–118.
C.P. Schnorr and H.W. Lenstra, Jr., A Monte Carlo factoring algorithm with finite storage, preprint.
M.C. Wunderlich, A report on the factorization of 2797 numbers using the continued fraction algorithm, unpublished manuscript.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pomerance, C. (1985). The Quadratic Sieve Factoring Algorithm. In: Beth, T., Cot, N., Ingemarsson, I. (eds) Advances in Cryptology. EUROCRYPT 1984. Lecture Notes in Computer Science, vol 209. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39757-4_17
Download citation
DOI: https://doi.org/10.1007/3-540-39757-4_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16076-2
Online ISBN: 978-3-540-39757-1
eBook Packages: Springer Book Archive