International Association for Cryptologic Research

International Association
for Cryptologic Research


Paper: Parallel Enumeration of Shortest Lattice Vectors

Özgür Dagdelen
Michael Schneider
Search ePrint
Search Google
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. Furthermore, lattice reduction is used to attack well-known cryptosystems like RSA. One of the algorithms used in lattice reduction is the enumeration algorithm (ENUM), that provably finds a shortest vector of a lattice. We present a parallel version of the lattice enumeration algorithm. Using multi-core CPU systems with up to 16 cores, our implementation gains a speed-up of up to factor 14. Compared to the currently best public implementation, our parallel algorithm saves more than 90% of runtime.
  title={Parallel Enumeration of Shortest Lattice Vectors},
  booktitle={IACR Eprint archive},
  keywords={implementation / shortest vector problem, parallelization, enumeration},
  note={ 14844 received 22 Feb 2010, last revised 23 Aug 2010},
  author={Özgür Dagdelen and Michael Schneider},