Advances in Cryptology – EUROCRYPT 2010

Volume 6110 of the series Lecture Notes in Computer Science pp 257-278

Lattice Enumeration Using Extreme Pruning

  • Nicolas GamaAffiliated withGREYC and ENSICAEN
  • , Phong Q. NguyenAffiliated withINRIA and ENS
  • , Oded RegevAffiliated withBlavatnik School of Computer Science, Tel Aviv University


Lattice enumeration algorithms are the most basic algorithms for solving hard lattice problems such as the shortest vector problem and the closest vector problem, and are often used in public-key cryptanalysis either as standalone algorithms, or as subroutines in lattice reduction algorithms. Here we revisit these fundamental algorithms and show that surprising exponential speedups can be achieved both in theory and in practice by using a new technique, which we call extreme pruning. We also provide what is arguably the first sound analysis of pruning, which was introduced in the 1990s by Schnorr et al.