LLL on the Average

Despite their popularity, lattice reduction algorithms remain mysterious in many ways. It has been widely reported that they behave much more nicely than what was expected from the worst-case proved bounds, both in terms of the running time and the output quality. In this article, we investigate this puzzling statement by trying to model the average case of lattice reduction algorithms, starting with the celebrated Lenstra-Lenstra-Lov

• Type: Conference
• Year: 2006
• Where: ANTS
• Authors: Phong Q. Nguyen, Damien Stehlé
• Keywords: Algorithms, ANTS 2006, Average Case, Lattice Reduction, Lattice Reduction Algorithms