Lattice reduction is a computationally hard problem of interest to both public-key cryptography and public-key cryptanalysis.
Despite its importance, extremely few algorithms are known. In this talk, we will survey all lattice reduction algorithms known, and we will try to speculate on future developments.
In doing so, we will emphasize a connection between those algorithms and the historical mathematical problem of bounding Hermite's constant.