Lattice Reduction Algorithms

Damien Stehlé · 2017

Lattice reduction aims at finding a basis consisting of rather short vectors, from an arbitrary basis of a Euclidean lattice. The importance of lattice reduction stems from the observation that many computational problems can be cast as finding short non-zero vectors in specific lattices (e.g., in computer algebra, cryptography and algorithmic number theory).

Read the paper · More papers on PaperTik