89 search results - page 2 / 18 » Algorithms for the Shortest and Closest Lattice Vector Probl... |
STOC
1999
ACM
13 years 9 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
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 l...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice v represented by some basis, and a target point y, nd the lattice point close...
EUROPAR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Lattice basis reduction is the problem of finding short vectors in lattices. The security of lattice based cryptosystems is based on the hardness of lattice reduction. Fu...