• DOI:10.1137/1.9781611973075.119
Corpus ID: 90084

Faster exponential time algorithms for the shortest vector problem

@inproceedings{Voulgaris2010FasterET,
  title={Faster exponential time algorithms for the shortest vector problem},
  author={Panagiotis Voulgaris and Daniele Micciancio},
  booktitle={SODA '10},
  year={2010}
}

• Panagiotis Voulgaris, Daniele Micciancio
• Published in SODA '10 2010
• Computer Science, Mathematics

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^{3.199<i>n</i>} (and space 2^{1.325<i>n</i>}), or in space 2^{1.095<i>n</i>} (and still time 2^<i>O(n)</i>). This improves the best previously known algorithm by Ajtai, Kumar and Sivakumar [Proceedings of STOC 2001] which was shown by Nguyen and… Expand

View on ACM

epubs.siam.org

Save to Library

Create Alert

Cite

Launch Research Feed