51 search results - page 3 / 11 » The Shortest Vector Problem in Lattices with Many Cycles |
TOC
2008
13 years 8 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
CODCRY
2011
Springer
13 years 4 days 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...
FOCS
2004
IEEE
14 years 9 days ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
STOC
1999
ACM
14 years 27 days 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...
SCN
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...