Lattice Enumeration Using Extreme Pruning

  • Nicolas Gama
  • Phong Q. Nguyen
  • Oded Regev
Conference paper

DOI: 10.1007/978-3-642-13190-5_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6110)
Cite this paper as:
Gama N., Nguyen P.Q., Regev O. (2010) Lattice Enumeration Using Extreme Pruning. In: Gilbert H. (eds) Advances in Cryptology – EUROCRYPT 2010. EUROCRYPT 2010. Lecture Notes in Computer Science, vol 6110. Springer, Berlin, Heidelberg


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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Nicolas Gama
    • 1
  • Phong Q. Nguyen
    • 2
  • Oded Regev
    • 3
  1. 1.GREYC and ENSICAENFrance
  2. 2.INRIA and ENSFrance
  3. 3.Blavatnik School of Computer ScienceTel Aviv UniversityIsrael

Personalised recommendations