Faster exponential time algorithms for the shortest vector problem

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 n-dimensional lattice can be found in time 23.199n

• Type: Conference
• Year: 2010
• Where: SODA
• Authors: Daniele Micciancio, Panagiotis Voulgaris
• Keywords: Arbitrary Lattices, Discrete Algorithms, N-dimensional Lattice, Shortest Vector Problem, SODA 2010