Skip to main content
Book cover

Workshop on the Theory and Application of of Cryptographic Techniques

EUROCRYPT 1984: Advances in Cryptology pp 169–182Cite as

The Quadratic Sieve Factoring Algorithm

  • Conference paper

    • We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

  • First Online:

Part of the Lecture Notes in Computer Science book series (LNCS,volume 209)

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.

Download conference paper PDF

References

  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.

    MATH  CrossRef  MathSciNet  Google Scholar 

  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. D.E. Knuth, The Art of Computer Programming, vol. 2, Seminumerical Algorithms, 2nd edition, Addison Wesley, Reading, Mass., 1981.

    MATH  Google Scholar 

  4. M. Kraitchik, Théorie des Nombres, Tome II, Gauthier-Villars, Paris, 1926.

    MATH  Google Scholar 

  5. M. Kraitchik, Recherches sur la Théorie des Nombres, Tome II, Factorisation, Gauthier-Villars, Paris, 1929.

    Google Scholar 

  6. D.H. Lehmer and R.E. Powers, On factoring large numbers, Bull. Amer. Math. Soc. 37 (1931), 770–776.

    MATH  CrossRef  MathSciNet  Google Scholar 

  7. J.C.P. Miller, On factorisation with a suggested new approach, Math. Comp. 29 (1975), 155–172.

    CrossRef  MathSciNet  Google Scholar 

  8. L. Monier, Algorithmes de factorisation d’entiers, thèse de 3e cycle, Orsay (1980).

    Google Scholar 

  9. P. Montgomery, private communication.

    Google Scholar 

  10. M.A. Morrison and J. Brillhart, A method of factoring and the factorization of F7, Math. Comp. 29 (1975), 183–205.

    MATH  CrossRef  MathSciNet  Google Scholar 

  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. C. Pomerance and S.S. Wagstaff, Jr., Implementation of the continued fraction algorithm, Cong. Numerantium 37 (1983), 99–118.

    MathSciNet  Google Scholar 

  13. C.P. Schnorr and H.W. Lenstra, Jr., A Monte Carlo factoring algorithm with finite storage, preprint.

    Google Scholar 

  14. M.C. Wunderlich, A report on the factorization of 2797 numbers using the continued fraction algorithm, unpublished manuscript.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Georgia, Athens, Georgia, 30602, USA

    Carl Pomerance

Authors
  1. Carl Pomerance
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Statistics and Computer Science Royal Holloway College, University of London Egham, Surrey, TW20 OEX, UK

    Thomas Beth

  2. U.E.R. Mathématiques, Logique Formelle, Informatique, Université Paris-5 Sorbonne, 75005, Paris, France

    Norbert Cot

  3. Department of Electrical Engineering, Linköping University, S-58183, Linkoping, Sweden

    Ingemar Ingemarsson

Rights and permissions

Reprints 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

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.