- The history of the LLL-algorithm
- Information Security and Cryptography : Texts and Monographs
- Pages (from-to)
- Document type
- Interfacultary Research Institutes
- Institute for Logic, Language and Computation (ILLC)
The 25th birthday of the LLL-algorithm was celebrated in Caen from 29th June to 1st July 2007. The three day conference kicked off with a historical session of four talks about the origins of the algorithm. The speakers were the three L’s and close bystander Peter van Emde Boas. These were the titles of their talks.
• A tale of two papers - Peter van Emde Boas.
• The early history of LLL - Hendrik Lenstra.
• The ellipsoid method and basis reduction - László Lovász.
• Polynomial factorization and lattices in the very early 1980s - Arjen Lenstra.
This chapter is based on those talks, conversations with these four historic characters, the notes that Peter van Emde Boas and Arjen Lenstra wrote for the preproceedings, and many artifacts from the phenomenal archive of Van Emde Boas.
- go to publisher's site
- Proceedings title: The LLL algorithm: survey and applications
Place of publication: Heidelberg
Editors: P.Q. Nguyen, B. Vallée
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.