University of Cambridge > Talks.cam > Churchill CompSci Talks > Lenstra's elliptic curve factorization method

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Lenstra's elliptic curve factorization method

Download to your calendar using vCal

If you have a question about this talk, please contact Matthew Ireland .

Integer factorization is an important problem in computational number theory with many applications in cryptography. Elliptic curves, on the other hands, are mathematical objects whose study predates the notion of computation by more than a century. In 1987, Lenstra described a new factoring algorithm using elliptic curves, which is still one of the fastest special purpose factorization algorithms invented so far. Conversely, the desire to rigorously analyze this algorithm has produced new results in number theory. This talk will describe his algorithm. No knowledge beyond basic number theory is required.

This talk is part of the Churchill CompSci Talks series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Galaxies Discussion Group Faculty of Asian & Middle Eastern Studies, Sidgwick Avenue Room FW11 at the William Gates Building and on Zoom: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon

Other talks

Shining a light on the origin of supermassive black holes with cosmological simulations CUSCRS and Renal Medicine Machine Politics? Computers and AI in the History of Political Thought Advances in Label-Free High-Resolution Molecular Imaging using J Series III Cluster SIMS Christopher Cowie on the epistemology of assessing biosignature claims Talk title TBC
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity