76 search results - page 1 / 16 » A sieve algorithm for the shortest lattice vector problem |
STOC
2001
ACM
14 years 5 months ago
2001
ACM
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
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...
CODCRY
2011
Springer
12 years 9 months ago
2011
Springer
We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problem...