Skip to main content
SpringerLink
Log in

Methods of factoring large integers

  • Conference paper
  • First Online:
Number Theory

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1240))

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 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight 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. Eric Bach, "Lenstra's algorithm for factoring with elliptic curves, Exposé," Computer Sciences Department, University of Wisconsin, Madison, February, 1985.

    Google Scholar 

  2. E. R. Berlekamp, "Factoring polynomials over large finite fields," Math. Comp., 24 (1970), 713–735.

    Article  MathSciNet  MATH  Google Scholar 

  3. B. J. Birch, "How the number of points of an elliptic curve over a fixed prime field varies," J. London Math. Soc., 43 (1968), 57–60.

    Article  MathSciNet  MATH  Google Scholar 

  4. Richard P. Brent, "Some integer factorization algorithms using elliptic curves," Research Report CMA-R32-85, Australian National University, September, 1985.

    Google Scholar 

  5. John Brillhart, D. H. Lehmer, J. L. Selfridge, Bryant Tuckerman and S. S. Wagstaff, Jr., Factorizations of b n±1, b=2, 3, 5, 6, 7, 10, 11, 12 up to high powers. Amer. Math. Soc., Providence (1983).

    MATH  Google Scholar 

  6. E. R. Canfield, P. Erdös and C. Pomerance, "On a problem of Oppenheim concerning ‘Factorisatio Numerorum'," J. Number Theory, 17 (1983), 1–28.

    Article  MathSciNet  MATH  Google Scholar 

  7. D. V. Chudnovsky and G. V. Chudnovsky, "Sequences of numbers generated by addition in formal groups and new primality and factorization tests," Research Report RC 11262 (#50739), IBM Research Center, Yorktown Heights, July, 1985.

    Google Scholar 

  8. A. J. C. Cunningham and H. J. Woodall, Factorisation of yn∓1, y=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers (n), Hodgson, London (1925).

    MATH  Google Scholar 

  9. J. A. Davis and D. B. Holdridge, "Factorization using the quadratic sieve algorithm," in Advances in Cryptology, Proceedings of Crypto 83, David Chaum, ed., Plenum Press, New York (1984), 103–113.

    Google Scholar 

  10. L. E. Dickson, History of the Theory of Numbers, vol. 1, Divisibility and Primality. Carnegie Institute of Washington (1919). Reprinted by Chelsea, New York (1971).

    Google Scholar 

  11. W. Diffie and M. Hellman, "New directions in cryptography," IEEE Trans. on Info. Theory, IT-22(6) (1976), 644–654.

    Article  MathSciNet  MATH  Google Scholar 

  12. Harvey Dubner and Robert Dubner, "The development of a powerful, low-cost computer for number theory applications," preprint, July, 1985.

    Google Scholar 

  13. J. L. Gerver, "Factoring large numbers with a quadratic sieve," Math. Comp., 41 (1983), 287–294.

    Article  MathSciNet  MATH  Google Scholar 

  14. Richard K. Guy, "How to factor a number," Congressus Numerantium, 16, Proc. Fifth Manitoba Conf. on Numerical Math., Winnipeg (1976), 49–89.

    Google Scholar 

  15. Jean-René Joly, "Équations et variétés algébriques sur un corps fini," l'Enseignement Math. (2), 19 (1973), 1–117.

    MathSciNet  MATH  Google Scholar 

  16. Donald E. Knuth, The Art of Computer Programming, vol. 2, Seminumerical Algorithms, 2nd ed. Addison-Wesley (1981).

    Google Scholar 

  17. M. Kraitchik, Recherches sur la théorie des nombres, Tome II, Gauthier-Villars, Paris (1929).

    MATH  Google Scholar 

  18. D. H. Lehmer, "Computer technology applied to the theory of numbers," in MAA Studies in Math. 6, W. J. LeVeque, ed. (1969), 117–151.

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  20. H. W. Lenstra, Jr., "Elliptic curve factorization," announcement of February 14, 1985.

    Google Scholar 

  21. Peter L. Montgomery, "Speeding the Pollard methods of factorization," preprint, December, 1985.

    Google Scholar 

  22. Michael A. Morrison and John Brillhart, A method of factoring and the factorization of F 7. Math. Comp., 29 (1975) 183–205.

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  24. Carl Pomerance, Analysis and comparison of some integer factoring algorithms. Computational methods in Number Theory, 89–139, H. W. Lenstra and R. Tijdeman, eds., Math. Centrum, Amsterdam (1983).

    Google Scholar 

  25. Carl Pomerance, "The quadratic sieve factoring algorithm," to appear in Proc. Eurocrypt 84, Paris, 1984.

    Google Scholar 

  26. Carl Pomerance and S. S. Wagstaff, Jr., Implementation of the continued fraction factoring algorithm. Congressus Numerantium, 37 (1983), 99–118.

    MathSciNet  MATH  Google Scholar 

  27. Carl Pomerance, J. W. Smith and Randy Tuler, "A pipe-line architecture for factoring large integers with the quadratic sieve algorithm," preprint, December, 1985.

    Google Scholar 

  28. Carl Pomerance, J. W. Smith and S. S. Wagstaff, Jr., "New ideas for factoring large integers," in Advances in Cryptology, Proceedings of Crypto 83, David Chaum, ed., Plenum Press, New York (1984), 81–85.

    Google Scholar 

  29. Hans Riesel, Prime Numbers and Computer Methods for Factorization, Birkhäuser, Boston (1985).

    Book  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  31. W. G. Rudd, Duncan A. Buell and Donald M. Chiarulli, "A high performance factoring machine," Proceedings of the Eleventh International Symposium on Computer Architecture, 1984.

    Google Scholar 

  32. Robert D. Silverman, "The multiple polynomial quadratic sieve," preprint, August, 1985.

    Google Scholar 

  33. Gustavus J. Simmons and Michael J. Norris, "How to cipher faster using redundant number systems," Sandia National Laboratories Report SAND80-1886 (1980).

    Google Scholar 

  34. J. W. Smith and S. S. Wagstaff, Jr., An extended precision operand computer. Proceedings of the Twenty-First Southeast Region ACM Conference, (1983), 209–216.

    Google Scholar 

  35. Hiromi Suyama, "Informal preliminary report (8)," 25 October 1985.

    Google Scholar 

  36. John T. Tate, "The arithmetic of elliptic curves," Invent. Math., 23 (1974), 179–206.

    Article  MathSciNet  MATH  Google Scholar 

  37. H. C. Williams, "Ap+1 method of factoring," Math. Comp., 39 (1982), 225–234.

    MathSciNet  MATH  Google Scholar 

  38. H. C. Williams, "An overview of factoring," in Advances in Cryptology, Proceedings of Crypto 83, David Chaum, ed., Plenum Press, New York (1984), 71–80.

    Google Scholar 

  39. Marvin C. Wunderlich, "Factoring numbers on the Massively Parallel Computer," in Advances in Cryptology, Proceedings of Crypto 83, David Chaum, ed., Plenum Press, New York (1984), 87–102.

    Google Scholar 

  40. Marvin C. Wunderlich, "Implementing the continued fraction factoring algorithm on parallel machines," Math. Comp., 44 (1985), 251–260.

    Article  MathSciNet  MATH  Google Scholar 

  41. John Brillhart, "Fermat's factoring method and its variants," Congressus Numerantium, 32 (1981), 29–48.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Sciences, Purdue University, 47907, West Lafayette, IN

    Samuel S. Wagstaff Jr.

  2. Department of Computer Science, University of Georgia, 30602, Athens, GA

    J. W. Smith

Authors
  1. Samuel S. Wagstaff Jr.
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. W. Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

David V. Chudnovsky Gregory V. Chudnovsky Harvey Cohn Melvyn B. Nathanson

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag

About this paper

Cite this paper

Wagstaff, S.S., Smith, J.W. (1987). Methods of factoring large integers. In: Chudnovsky, D.V., Chudnovsky, G.V., Cohn, H., Nathanson, M.B. (eds) Number Theory. Lecture Notes in Mathematics, vol 1240. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0072986

Download citation

  • DOI: https://doi.org/10.1007/BFb0072986

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17669-5

  • Online ISBN: 978-3-540-47756-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation