Skip to main content
SpringerLink
Log in

Integer Factoring

  • Chapter
Book cover Towards a Quarter-Century of Public Key Cryptography

Abstract

Using simple examples and informal discussions this article surveys the key ideas and major advances of the last quarter century in integer factorization.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. M. Adleman, Factoring numbers using singular integers, Proc. 23rd Annual ACM Symp. on Theory of Computing (STOC), New Orleans, (May 6–8, 1991 ) pp. 64–71.

    Google Scholar 

  2. W. R. Alford, A. Granville, and C. Pomerance, There are infinitely many Carmichael numbers, Ann. of Math, Vol. 140 (1994) pp. 703–722.

    Article  MathSciNet  Google Scholar 

  3. W. R. Alford, A. Granville, and C. Pomerance, On the difficulty of finding reliable witnesses, ANTS’94, Lecture Notes in Comput. Sci., 877 (1994) pp. 1–16.

    MathSciNet  Google Scholar 

  4. D. Atkins, M. Graff, A. K. Lenstra, and P. C. Leyland, The magic words are squeamish ossifrage, Advances in Cryptology, Asiacrypt’94, Lecture Notes in Comput. Sci., 917 (1995) pp. 265–277.

    MathSciNet  Google Scholar 

  5. D. J. Bernstein, The multiple-lattice number field sieve, Chapter 3 of Ph.D. thesis; ftp://koobera.math.uic.edu/pub/papers/mlnfs.dvi.

    Google Scholar 

  6. W. Bosma and A. K. Lenstra, Computational Algebra and Number Theory (W. Bosma and A. van der Poorten, eds.), Kluwer Academic Publishers, Dordrecht, Boston, London (1995) pp. 119–136.

    Google Scholar 

  7. R. P. Brent, Factorization of the tenth and eleventh Fermat Numbers, manuscript (1996).

    Google Scholar 

  8. R. P. Brent and J. M. Pollard, Factorization of the eighth Fermat number, Math. Comp.. Vol. 36 (1981) pp. 627–630.

    Article  MathSciNet  MATH  Google Scholar 

  9. J. Buchmann, J. Loho, and J. Zayer, An implementation of the general number field sieve, Advances in Cryptology, Crypto ‘83, Lecture Notes in Comput. Sci, 773 (1994) pp. 159–165.

    MathSciNet  Google Scholar 

  10. E. R. Canfield, P. Erdös, and C. Pomerance, On a problem of Oppenheim concerning “Factorisatio Numero-rum,” J. Number Theory, Vol. 17 (1983) pp. 1–28.

    Article  MathSciNet  MATH  Google Scholar 

  11. H. Cohen, A course in computational number theory, Graduate Texts in Mathematics, Vol. 138, Springer-Verlag, Berlin (1993).

    Google Scholar 

  12. S. Contini and A. K. Lenstra, Implementations of blocked Lanczos and Wiedemann algorithms, manuscript.

    Google Scholar 

  13. J. Cowie, B. Dodson, R. M. Elkenbracht-Huizing, A. K. Lenstra, P. L. Montgomery, and J. Zayer, A World Wide Number Field Sieve factoring record: on to 512 bits, Advances in Cryptography, Asiacrypt ‘86, Lecture Notes in Computer Science, 1163 (1996) pp. 382–394.

    Article  MathSciNet  Google Scholar 

  14. J. A. Davis and D. B. Holdridge, Factorization using the quadratic sieve algorithm, Tech. Report SAND 83–1346, Sandia National Laboratories, Albuquerque, NM (1983).

    Google Scholar 

  15. N. G. de Bruijn, On the number of positive integers x and free of prime factors y, II, Iodag. Math., Vol. 38 (1966) pp. 239–247.

    MathSciNet  Google Scholar 

  16. M. Deleglise and J. Rivat, Computing 1r (x): the Meissel, Lehmer, Lagarias, Miller, Odlyzko method, Math. Comp., Vol. 65 (1996) pp. 235–245.

    Article  MathSciNet  MATH  Google Scholar 

  17. T. Denny, B. Dodson, A. K. Lenstra, and M. S. Manasse, On the factorization of RSA-120, Advances in Cryptology, Crypt° ‘83, Lecture Notes in Comput. Sci., 773 (1994) pp. 166–174.

    MathSciNet  Google Scholar 

  18. B. Dodson and A. K. Lenstra, NFS with four large primes: an explosive experiment, Advances in Cryptology, Crypto ‘85, Lecture Notes in Comput. Sci., 963 (1995) pp. 372–385.

    MathSciNet  Google Scholar 

  19. 19. R. M. Elkenbracht Huizing, An implementation of the number field sieve, Technical Report NM-R9511, Centrum voor Wiskunde en Informatica, Amsterdam, 1995; to appear in Experimental Mathematics.

    Google Scholar 

  20. R. M. Elkenbracht-Huizing, A multiple polynomial general number field sieve, Preproceedings ANTS II (II. Cohen, ed. ), Université de Bordeaux (1996) pp. 101–116.

    Google Scholar 

  21. M. Gardner, Mathematical games, A new kind of cipher that would take millions of years to break, Scientific American (August 1977) pp. 120–124.

    Google Scholar 

  22. Gillogly, A. K. Lenstra, R. C. Leyland, and A. Muffett, An unnoticed factoring attack on a PGP key, presented at Crypto ‘85 rump session.

    Google Scholar 

  23. R. Golliver, A. K. Lenstra, and K. McCurley, Lattice sieving and trial division, ANTS’94, Lecture Notes in Comput. Sci., 877 (1994) pp. 18–27.

    MathSciNet  Google Scholar 

  24. G. H. Hardy and W. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford University Press, Oxford (1979).

    MATH  Google Scholar 

  25. D. E. Knuth, Art of computer programming, volume 2, Seminumerical Algorithms, 2nd ed., Addison-Wesley, Reading, Massachusetts (1981).

    Google Scholar 

  26. M. Kraïtchik, Theorie de Nombres, II, Gauthiers-Villars, Paris (1926) pp. 195–208.

    Google Scholar 

  27. J. C. Lagarias, V. S. Miller, and A. M. Odlyzko, Computing 71 - (x): The Meissel-Lehmer Method, Math. Comp., Vol. 44 (1985) pp. 537–560.

    MathSciNet  MATH  Google Scholar 

  28. B. A. LaMacchia and A. M. Odlyzko, Solving large sparse linear systems over finite fields, Advances in Cryptology, Crypto’90, Lecture Notes in Comput. Sci., 537 (1991) pp. 109–133.

    Google Scholar 

  29. A. K. Lenstra and H. W. Lenstra, Jr., Algorithms in number theory, Chapter 12 in Handbook of Theoretical Computer Science, Volume A, Algorithms and Complexity (J. van Leeuwen, ed.), Elsevier, Amsterdam (1990).

    Google Scholar 

  30. A. K. Lenstra and H. W. Lenstra, Jr., The development of the number field sieve, Lecture Notes in Math., Springer-Verlag, Berlin, 1554 (1993).

    Google Scholar 

  31. A. K. Lenstra, H. W. Lenstra, Jr., M. S. Manasse, and J. M. Pollard, The factorization of the ninth Fermat number, Math. Comp., Vol. 61 (1993) pp. 319–349.

    Article  MathSciNet  MATH  Google Scholar 

  32. A. K. Lenstra and M. S. Manasse, Factoring by electronic mail, Advances in Cryptology, Eurocrypt ‘89, Lecture Notes in Comput. Sci., 434 (1990) pp. 355–371.

    MathSciNet  Google Scholar 

  33. A. K. Lenstra and M. S. Manasse, Factoring with two large primes, Advances in Cryptology, Eurocrypt ‘80, Lecture Notes in Comput. Sci., 473 (1990) pp. 72–82; Math. Comp., Vol. 63 (1994) pp. 785–798.

    Article  MathSciNet  MATH  Google Scholar 

  34. H. W. Lenstra, Jr., Factoring integers with elliptic curves, Ann. of Math, Vol. 126 (1987) pp. 649–673.

    Article  MathSciNet  MATH  Google Scholar 

  35. H. W. Lenstra, Jr., and C. Pomerance, A rigorous time bound for factoring integers, J. Amer. Math. Soc., Vol. 5 (1992) pp. 483–516.

    MathSciNet  MATH  Google Scholar 

  36. H. W. Lenstra, Jr. and R. Tijdeman (eds.), Computational methods in number theory, Math. Centre Tracts, Vol. 154/155, Mathematisch Centrum, Amsterdam (1983).

    Google Scholar 

  37. P. C. Leyland, Multiple polynomial quadratic sieve, sans math, ftp://ftp.ox.ac.uk/pub/math/rsa129/ mpgs_sans_math.Z (1994).

    Google Scholar 

  38. L. Monier, Evaluation and comparison of two efficient probabilistic primality testing algorithms, Theor. Comp. Science, Vol. 11 (1980) pp. 97–108.

    Article  MathSciNet  Google Scholar 

  39. P. L. Montgomery, Speeding the Pollard and elliptic curve methods of factorization, Math. Comp., Vol. 48 (1987) pp. 243–264.

    Article  MathSciNet  MATH  Google Scholar 

  40. P. L. Montgomery, Square roots of products of algebraic numbers, Proceedings of Symposia in Applied Mathematics (Walter Gautschi, ed.), Mathematics of Computation 1943–1993, Vancouver (1993).

    Google Scholar 

  41. P. L. Montgomery, A block Lanczos algorithm for finding dependencies over GF(2), Advances in Cryptology, Eurocrypt’95, Lecture Notes in Comput. Sci., 921 (1995) pp. 106–120.

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  43. J. M. Pollard, Theorems on factorization and primality testing, Proc. Cambridge Philos. Soc., Vol. 76 (1974) pp. 521–528.

    Article  MathSciNet  MATH  Google Scholar 

  44. J. M. Pollard, A Monte Carlo method for factorization, BIT, Vol. 15 (1975) pp. 331–334.

    Article  MathSciNet  MATH  Google Scholar 

  45. J. M. Pollard, The lattice sieve, Lecture Notes in Math., Springer-Verlag, Berlin, 1554 (1993) pp. 43–49.

    MathSciNet  Google Scholar 

  46. C. Pomerance, Analysis and comparison of some integer factoring algorithms, Computational methods in number theory, Math. Centre Tracts, Vol. 154/155, Mathematisch Centrum, Amsterdam (1983) pp. 89–139.

    Google Scholar 

  47. C. Pomerance, Private communication (March 1996).

    Google Scholar 

  48. C. Pomerance and J. W. Smith, Reduction of huge, sparse matrices over finite fields via created catastrophes, Experiment. Math., Vol. 1 (1992) pp. 89–94.

    Article  MathSciNet  MATH  Google Scholar 

  49. M. O. Rabin, Probabilistic algorithms for primality testing, J. Number Theory, Vol. 12 (1980) pp. 128–138.

    Article  MathSciNet  MATH  Google Scholar 

  50. H. Riesel, Prime numbers and computer methods for factorization. Progr. Math., Vol. 57, Birkhäuser, Boston (1985).

    Google Scholar 

  51. R. L. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Comm. ACM, Vol. 21 (1978) pp. 120–126.

    Article  MathSciNet  MATH  Google Scholar 

  52. R. Schoof, Quadratic fields and factorization, Computational methods in number theory, Math. Centre Tracts, Vol. 154/155, Mathematisch Centrum, Amsterdam (1983) pp. 235–286.

    Google Scholar 

  53. D. Shanks, Class number, a theory of factorization, and genera, Proc. Symp. Pure Math., Vol. XX, AMS (1971) pp. 415–440.

    Google Scholar 

  54. R. D. Silverman, The multiple polynomial quadratic sieve, Math. Comp., Vol. 84 (1987) pp. 327–339.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Citibank, N.A., 1 North Gate Road, Mendham, NJ, 07945-3104, USA

    Arjen K. Lenstra

Authors
  1. Arjen K. Lenstra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Washington, USA

    Neal Koblitz

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media New York

About this chapter

Cite this chapter

Lenstra, A.K. (2000). Integer Factoring. In: Koblitz, N. (eds) Towards a Quarter-Century of Public Key Cryptography. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6856-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-6856-5_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4972-1

  • Online ISBN: 978-1-4757-6856-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation