The LLL algorithm was invented by Arjen Lenstra, Hendrik Lenstra and László Lovász. This polynomial time algorithm was published in 1982 and has found numerous applications in algebra, number theory and cryptography. It has been implemented in all major computer algebra systems. The LLL algorithm takes as input a basis of a lattice L in the Euclidean space and outputs the reduced basis of L. The main goal of my talk is to give an accessible presentation of this important algorithm.
|Presenter:||Benjamin Cortese (Undergraduate Student)|
|Time:||9:50 am (Session I)|