Cryptology ePrint Archive: Report 2018/586

Lower Bounds on Lattice Enumeration with Extreme Pruning

Yoshinori Aono and Phong Q. Nguyen and Takenobu Seito and Junji Shikata

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.

Category / Keywords: Lattices, Enumeration, Pruning, Security Estimates

Original Publication (in the same form): IACR-CRYPTO-2018

Date: received 7 Jun 2018, last revised 27 Jun 2018

Contact author: Phong Nguyen at inria fr

Available format(s): PDF | BibTeX Citation

Version: 20180628:022921 (All versions of this report)

Short URL: ia.cr/2018/586


[ Cryptology ePrint archive ]