Faster exponential time algorithms for the shortest vector problem

  title={Faster exponential time algorithms for the shortest vector problem},
  author={Panagiotis Voulgaris and Daniele Micciancio},
  booktitle={SODA '10},
We present new faster algorithms for the exact solution of the shortest vector problem in arbitrary lattices. Our main result shows that the shortest vector in any <i>n</i>-dimensional lattice can be found in time 2<sup>3.199<i>n</i></sup> (and space 2<sup>1.325<i>n</i></sup>), or in space 2<sup>1.095<i>n</i></sup> (and still time 2<sup><i>O(n)</i></sup>). This improves the best previously known algorithm by Ajtai, Kumar and Sivakumar [Proceedings of STOC 2001] which was shown by Nguyen and… Expand
187 Citations
Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract
  • 71
  • PDF
A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
  • 188
  • PDF
Solving the Closest Vector Problem in 2^n Time -- The Discrete Gaussian Strikes Again!
  • 56
  • PDF
Approximate Algorithms on Lattices with Small Determinant ( Extended Abstract )
  • 10
  • PDF
Time-Memory Trade-Off for Lattice Enumeration in a Ball
  • 7
  • PDF
Space-efficient classical and quantum algorithms for the shortest vector problem
  • 4
  • Highly Influenced
  • PDF
Finding Shortest Lattice Vectors in the Presence of Gaps
  • 31
  • PDF
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search
  • 28
  • PDF


A sieve algorithm for the shortest lattice vector problem
  • 500
  • Highly Influential
  • PDF
Sieve algorithms for the shortest vector problem are practical
  • 170
  • Highly Influential
  • PDF
Improved algorithms for integer programming and related lattice problems
  • R. Kannan
  • Mathematics, Computer Science
  • STOC '83
  • 1983
  • 430
  • Highly Influential
  • PDF
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems
  • 659
  • Highly Influential
  • PDF
Bounds for packings on a sphere and in space
  • Problemy Peredachi Informatsii,
  • 1978