Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract

@article{Aggarwal2015SolvingTS,
  title={Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract},
  author={D. Aggarwal and D. Dadush and O. Regev and Noah Stephens-Davidowitz},
  journal={Proceedings of the forty-seventh annual ACM symposium on Theory of Computing},
  year={2015}
}
We give a randomized 2n+o(n)-time and space algorithm for solving the Shortest Vector Problem (SVP) on n-dimensional Euclidean lattices. This improves on the previous fastest algorithm: the deterministic ~O(4n)-time and ~O(2n)-space algorithm of Micciancio and Voulgaris (STOC 2010, SIAM J. Comp. 2013). In fact, we give a conceptually simple algorithm that solves the (in our opinion, even more interesting) problem of discrete Gaussian sampling (DGS). More specifically, we show how to sample 2n/2… Expand
71 Citations
Solving the Closest Vector Problem in 2^n Time -- The Discrete Gaussian Strikes Again!
  • 56
  • PDF
Time-Memory Trade-Off for Lattice Enumeration in a Ball
  • 7
  • Highly Influenced
  • PDF
Discrete Gaussian Sampling Reduces to CVP and SVP
  • 27
  • PDF
On approximating the covering radius and finding dense lattice subspaces
  • D. Dadush
  • Mathematics, Computer Science
  • STOC
  • 2019
  • 2
  • PDF
Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
  • 124
  • PDF
Tuple lattice sieving
  • 35
  • PDF
Approximate CVP p in Time 2 0.802 n .
  • 1
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-7 OF 7 REFERENCES
A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
  • 188
  • Highly Influential
  • PDF
An Efficient and Parallel Gaussian Sampler for Lattices
  • 277
  • Highly Influential
  • PDF
Minkowski's Convex Body Theorem and Integer Programming
  • R. Kannan
  • Mathematics, Computer Science
  • Math. Oper. Res.
  • 1987
  • 659
  • Highly Influential
Trapdoors for hard lattices and new cryptographic constructions
  • 1,584
  • Highly Influential
  • PDF
Private communication
  • 7,065
  • Highly Influential
  • PDF
Levenšteı̆n. Bounds for packings on the sphere and in space
  • Problemy Peredači Informacii,
  • 1978
Levenšte˘ ın. Bounds for packings on the sphere and in space
  • Problemy Peredači Informacii
  • 1978