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

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

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

Personalised recommendations