The LLL-Algorithm: Lattice Basis Reduction in Polynomial Time

This thesis presents the Lenstra, Lenstra, and Lovász algorithm (more commonly the LLL-algorithm), which performs lattice basis reduction in polynomial time. Some basic results regarding lattices and lattice basis reduction are established, and an implementation of the LLL-algorithm in MATLAB is presented. Numerical test on the implementation are performed, and seem to indicate the expected polynomial complexity