Welcome to the resource topic for 2018/586
Title:
Lower Bounds on Lattice Enumeration with Extreme Pruning
Authors: Yoshinori Aono, Phong Q. Nguyen, Takenobu Seito, 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.
ePrint: https://eprint.iacr.org/2018/586
Talk: https://www.youtube.com/watch?v=9i9BCsHxofE
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .