Lower Bounds on Lattice Enumeration with Extreme Pruning

Abstract : At Eurocrypt '10, Gama, Nguyen and Regev introduced lattice enumeration with extreme pruning: this algorithm is implemented in state-of-the-art lattice reduction software and used in challenge records. They showed that extreme pruning provided an exponential speed-up over full enumeration. However, no limit on its efficiency was known, which was problematic for long-term security estimates of lattice-based cryptosystems. We prove the first lower bounds on lattice enumeration with extreme pruning: if the success probability is lower bounded, we can lower bound the global running time taken by extreme pruning. Our results are based on geometric properties of cylinder intersections and some form of isoperimetry. We discuss their impact on lattice security estimates.
Liste complète des métadonnées

Cited literature [2 references]  Display  Hide  Download

Contributor : Phong Q. Nguyen <>
Submitted on : Friday, July 20, 2018 - 5:11:46 AM
Last modification on : Wednesday, April 3, 2019 - 1:28:39 AM
Document(s) archivé(s) le : Sunday, October 21, 2018 - 12:35:52 PM


Files produced by the author(s)



Yoshinori Aono, Phong Q. Nguyen, Takenobu Seito, Junji Shikata. Lower Bounds on Lattice Enumeration with Extreme Pruning. CRYPTO 2018, 38th Annual International Cryptology Conference, IACR, Aug 2018, Santa-Barbara, United States. ⟨10.1007/978-3-319-96881-0_21⟩. ⟨hal-01845023⟩



Record views


Files downloads