Faster exponential time algorithms for the shortest vector problem

14 years 1 months ago

Download cseweb.ucsd.edu

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

Daniele Micciancio, Panagiotis Voulgaris

Real-time Traffic

Arbitrary Lattices | Discrete Algorithms | N-dimensional Lattice | Shortest Vector Problem | SODA 2010 |

claim paper

» Faster Algorithms for Allpairs Approximate Shortest Paths in Undirected Graphs

» Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm vi...

» Optimal lower bounds for the KorkineZolotareff parameters of a lattice and for Schnorrs al...

» Hardness of Approximating the Shortest Vector Problem in Lattices

» On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lat...

» Faster Approximation of Distances in Graphs

» Parallel Shortest Lattice Vector Enumeration on Graphics Cards

» A Faster Lattice Reduction Method Using Quantum Search

Post Info
More Details (n/a)

Added	01 Mar 2010
Updated	02 Mar 2010
Type	Conference
Year	2010
Where	SODA
Authors	Daniele Micciancio, Panagiotis Voulgaris

Comments (0)

Sciweavers

Faster exponential time algorithms for the shortest vector problem

Arbitrary Lattices | Discrete Algorithms | N-dimensional Lattice | Shortest Vector Problem | SODA 2010 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers