Flags and Lattice Basis Reduction
Hendrik W. Lenstra · Progress in mathematics · 2001
In this lecture we give a self-contained introduction to the theory of lattices in Euclidean vector spaces. We reinterpret a large class of lattice basis reduction algorithms by using the concept of a “flag”. In our reformulation, lattice basis reduction algorithms are more appropriately called “flag reduction” algorithms. We address a problem that arises when one attempts to find a particularly good flag for a given lattice. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.