The Quadratic Sieve Factoring Algorithm

  • Carl Pomerance
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 209)


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


  1. [1]
    E.R. Canfield, P. Erdös and C. Pomerance, On a problem of Oppenheim concerning “Factorisatio Numerorum”, J. Number Theory, 17 (1983), 1–28.zbMATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    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.Google Scholar
  3. [3]
    D.E. Knuth, The Art of Computer Programming, vol. 2, Seminumerical Algorithms, 2nd edition, Addison Wesley, Reading, Mass., 1981.zbMATHGoogle Scholar
  4. [4]
    M. Kraitchik, Théorie des Nombres, Tome II, Gauthier-Villars, Paris, 1926.zbMATHGoogle Scholar
  5. [5]
    M. Kraitchik, Recherches sur la Théorie des Nombres, Tome II, Factorisation, Gauthier-Villars, Paris, 1929.Google Scholar
  6. [6]
    D.H. Lehmer and R.E. Powers, On factoring large numbers, Bull. Amer. Math. Soc. 37 (1931), 770–776.zbMATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    J.C.P. Miller, On factorisation with a suggested new approach, Math. Comp. 29 (1975), 155–172.CrossRefMathSciNetGoogle Scholar
  8. [8]
    L. Monier, Algorithmes de factorisation d’entiers, thèse de 3e cycle, Orsay (1980).Google Scholar
  9. [9]
    P. Montgomery, private communication.Google Scholar
  10. [10]
    M.A. Morrison and J. Brillhart, A method of factoring and the factorization of F7, Math. Comp. 29 (1975), 183–205.zbMATHCrossRefMathSciNetGoogle Scholar
  11. [11]
    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.Google Scholar
  12. [12]
    C. Pomerance and S.S. Wagstaff, Jr., Implementation of the continued fraction algorithm, Cong. Numerantium 37 (1983), 99–118.MathSciNetGoogle Scholar
  13. [13]
    C.P. Schnorr and H.W. Lenstra, Jr., A Monte Carlo factoring algorithm with finite storage, preprint.Google Scholar
  14. [14]
    M.C. Wunderlich, A report on the factorization of 2797 numbers using the continued fraction algorithm, unpublished manuscript.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Carl Pomerance
    • 1
  1. 1.Department of MathematicsUniversity of GeorgiaAthensUSA

Personalised recommendations