Sciweavers

EUROPAR
2010
Springer
13 years 5 months ago
Parallel Enumeration of Shortest Lattice Vectors
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...
Özgür Dagdelen, Michael Schneider 0002
ISAAC
2003
Springer
115views Algorithms» more  ISAAC 2003»
13 years 9 months ago
A Faster Lattice Reduction Method Using Quantum Search
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
Christoph Ludwig