Cryptology ePrint Archive: Report 2010/097

Parallel Enumeration of Shortest Lattice Vectors

Özgür Dagdelen and Michael Schneider

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.

Category / Keywords: implementation / shortest vector problem, parallelization, enumeration

Date: received 22 Feb 2010, last revised 23 Aug 2010

Contact author: mischnei at cdc informatik tu-darmstadt de

Available format(s): PDF | BibTeX Citation

Version: 20100823:090510 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]