Parallel Enumeration of Shortest Lattice Vectors

• Published in: Euro-Par 2010 - Parallel Processing pp. 211 - 222
• Main Authors: Dagdelen, Özgür, Schneider, Michael
• Format: Book Chapter
• Language: English; Japanese
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2010
• Series: Lecture Notes in Computer Science
• Subjects: cryptography; enumeration; lattice reduction; parallelization; shortest vector problem
• ISBN: 9783642152900; 3642152902
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-642-15291-7_21

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.