Faster exponential time algorithms for the shortest vector problem

275 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Faster Fully Homomorphic Encryption (2010, background): “, [8, 23, 16]), but so far they have only lead to improved constants, without changing the overall framework.”
BKZ 2.0: Better Lattice Security Estimates (2011, methodology): “And more experiments than [36,30] would be required to evaluate precisely their practical running time.”
Better Key Sizes (and Attacks) for LWE-Based Encryption (2011, methodology): “There are also singleexponential time algorithms for the Shortest Vector Problem [5, 27 , 26], which can run faster in practice than Schnorr-Euchner enumeration in certain low dimensions; however, these algorithms also require exponential space.”
Post-quantum Key Exchange - A New Hope (2016, background): “A lot of recent work has pushed the efficiency of the original lattice sieve algorithms [65, 67], improving the heuristic complexity from”
A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations (2010, methodology): “In the case of SVP, we achieve single exponential time as in [5, 44, 42, 46], but without using randomization and achieving a better constant in the exponent.”
Lattice Enumeration Using Extreme Pruning (2010, methodology): “An alternative algorithmic technique for solving lattice problems was suggested in 2001 by Ajtai, Kumar, and Sivakumar [4] (see also [5,26,21,29] for recent improvements).”