Lenstra's elliptic curve factorization method

Add to your list(s) Download to your calendar using vCal

• Leo Lai, Churchill College
• Wednesday 27 January 2016, 19:30-20:15
• Wolfson Hall, Churchill College.

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:

• Churchill CompSci Talks
• Wolfson Hall, Churchill College
• computer science
• se393's list

Note that ex-directory lists are not shown.