Sciweavers

ANTS
2006
Springer

LLL on the Average

14 years 2 months ago
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
Phong Q. Nguyen, Damien Stehlé
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Where ANTS
Authors Phong Q. Nguyen, Damien Stehlé
Comments (0)