Skip to main content
SpringerLink
Log in

Elliptic Curve Method for Factoring

  • Reference work entry
Encyclopedia of Cryptography and Security

  • 372 Accesses

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 799.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 949.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

Recommended Reading

  1. Atkin AOL, Morain F (1993) Finding suitable curves for the elliptic curve method of factorization. Math Comput 60(201):399–405

    Article  MATH  MathSciNet  Google Scholar 

  2. Brent RP (1986) Some integer factorization algorithms using elliptic curves. Australian Comput Sci Commun 8:149–163. http://maths.anu.edu.au/∼brent/pub/pub102.html

  3. Brent RP (1999) Factorization of the tenth Fermat number. Math Comput 68(225):429–451

    Article  MATH  MathSciNet  Google Scholar 

  4. Brillhart J, Lehmer DH, Selfridge JL, Tuckerman B, Wagstaff SS Jr (2002) Factorizations of { b}{ n} ± 1 for b = 2, 3, 5, 6, 7, 10, 11, 12 up to high powers, 3rd edn., vol 22 of Contemporary mathematics. American Math Society. http://www.cerias.purdue.edu/homes/ssw/cun/third/

  5. Lenstra HW (1987) Factoring integers with elliptic curves. Ann of Math 126:649–673

    Article  MATH  MathSciNet  Google Scholar 

  6. Mihailescu P (1998) Cyclotomy primality proving – recent developments. In: Proceedings of ANTS III. Lecture notes in computer science, vol 1423. Portland, OR, pp 95–110

    Google Scholar 

  7. Montgomery PL (1987) Speeding the Pollard and elliptic curve methods of factorization. Math Comput 48(177):243–264

    Article  MATH  Google Scholar 

  8. Montgomery PL (1992) An FFT extension of the elliptic curve method of factorization. PhD thesis, University of California, Los Angeles, 1992. ftp.cwi.nl:/pub/pmontgom/ucladissertation.psl.gz

  9. van de Lune J, Wattel E (1969) On the numerical solution of a differential-difference equation arising in analytic number theory. Math Comput 23(106):417–421

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Team Caramel, Bâtiment A, LORIA/INRIA, 615 rue du jardin botanique, F-54602, Villers-lès-Nancy Cedex, France

    Paul Zimmermann Dr.

Authors
  1. Paul Zimmermann Dr.
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computing Science, Eindhoven University of Technology, 5600 MB, Eindhoven, The Netherlands

    Henk C. A. van Tilborg

  2. Center for Secure Information Systems, George Mason University, Fairfax, VA, 22030-4422, USA

    Sushil Jajodia

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Zimmermann, P. (2011). Elliptic Curve Method for Factoring. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_401

Download citation

Publish with us

Policies and ethics

Search

Navigation