A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations

@article{Micciancio2010ADS,
  title={A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations},
  author={Daniele Micciancio and Panagiotis Voulgaris},
  journal={Electron. Colloquium Comput. Complex.},
  year={2010},
  volume={17},
  pages={14}
}
We give deterministic ~O(22n+o(n))-time algorithms to solve all the most important computational problems on point lattices in NP, including the Shortest Vector Problem (SVP), Closest Vector Problem (CVP), and Shortest Independent Vectors Problem (SIVP). This improves the nO(n) running time of the best previously known algorithms for CVP (Kannan, Math. Operation Research 12(3):415--440, 1987) and SIVP (Micciancio, Proc. of SODA, 2008), and gives a deterministic and asymptotically faster… Expand
188 Citations
Lattice Sparsification and the Approximate Closest Vector Problem
  • 15
  • PDF
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
  • 11
  • Highly Influenced
  • PDF
Approximate Voronoi cells for lattices, revisited
  • 4
  • PDF
Time-Memory Trade-Off for Lattice Enumeration in a Ball
  • 7
  • PDF
Covering cubes and the closest vector problem
  • 25
  • PDF
Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract
  • 71
  • Highly Influenced
  • PDF
A Randomized Sieving Algorithm for Approximate Integer Programming
  • D. Dadush
  • Mathematics, Computer Science
  • Algorithmica
  • 2013
  • 9
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-6 OF 6 REFERENCES
Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima
  • 67
  • Highly Influential
Closest point search in lattices
  • 1,417
  • Highly Influential
  • PDF
Finding the Closest Lattice Point by Iterative Slicing
  • 9
  • Highly Influential
A sieve algorithm for the shortest lattice vector problem
  • 500
  • Highly Influential
  • PDF
Minkowski's Convex Body Theorem and Integer Programming
  • R. Kannan
  • Mathematics, Computer Science
  • Math. Oper. Res.
  • 1987
  • 659
  • Highly Influential
Factoring polynomials with rational coefficients
  • 3,756
  • Highly Influential
  • PDF