Coppersmith's Theorem: Background, Generalizations and Applications

These are presentation materials associated with the UCI Number Theory Seminars that I presented in October 2010.

Here are the papers that I presented:

Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding by Henry Cohn and Nadia Heninger
Using LLL-reduction for solving RSA and factorization problems by Alexander May

Nadia Heninger's rump session presentation at Crypto 2010

After my presentation, the following relevant papers/presentations were published:

Nadia Heninger's January 8, 2011 talk at UCSD
Ideal Forms of Coppersmith's Theorem and Guruswami-Sudan List Decoding, the final paper, published at Innovations in Computer Science 2011, pp 298-308.

Here are the books that I referenced in my presentation:

The LLL Algorithm: Survey and Applications edited by Phong Q. Nguyen and Brigitte Vallee
A Course in Computational Algebraic Number Theory by Henri Cohen

A copy of my slide set:

My 2010-Oct-07 and 2010-Oct-21 presentation (revision 4).

This page can be accessed using the bit.ly link http://bit.ly/CuSmith

You can send comments to me at: josh (dash) math (at) untruth (dot) org.