Sciweavers

51 search results - page 1 / 11
» The Shortest Vector Problem in Lattices with Many Cycles
Sort
View
CALC
2001
Springer
161views Cryptology» more  CALC 2001»
13 years 9 months ago
The Shortest Vector Problem in Lattices with Many Cycles
In this paper we investigate how the complexity of the shortest vector problem in a lattice Λ depends on the cycle structure of the additive group Zn /Λ. We give a proof that the...
Mårten Trolin
STACS
2004
Springer
13 years 10 months ago
Lattices with Many Cycles Are Dense
Abstract We give a method for approximating any n-dimensional lattice with a lattice Λ whose factor group Zn /Λ has n − 1 cycles of equal length with arbitrary precision. We al...
Mårten Trolin
CORR
2010
Springer
178views Education» more  CORR 2010»
13 years 3 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
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...
Daniel Dadush, Chris Peikert, Santosh Vempala
SODA
2010
ACM
232views Algorithms» more  SODA 2010»
14 years 2 months ago
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 l...
Daniele Micciancio, Panagiotis Voulgaris
STOC
2001
ACM
160views Algorithms» more  STOC 2001»
14 years 5 months ago
A sieve algorithm for the shortest lattice vector problem
Miklós Ajtai, Ravi Kumar, D. Sivakumar