Parallel Shortest Lattice Vector Enumeration on Graphics Cards

In this paper we present an algorithm for parallel exhaustive search for short vectors in lattices. This algorithm can be applied to a wide range of parallel computing systems. To illustrate the algorithm, it was implemented on graphics cards using CUDA, a programming framework for NVIDIA graphics cards. We gain large speedups compared to previous serial CPU implementations. Our implementation is almost 5 times faster in high lattice dimensions. Exhaustive search is one of the main building blocks for lattice basis reduction in cryptanalysis. Our work results in an advance in practical lattice reduction.

• Type: Conference
• Year: 2010
• Where: AFRICACRYPT
• Authors: Jens Hermans, Michael Schneider 0002, Johannes Buchmann, Frederik Vercauteren, Bart Preneel
• Keywords: AFRICACRYPT 2010, Cryptology, Exhaustive Search, Lattice Basis Reduction, Parallel Exhaustive Search