Abstract
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. © 2010 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Hermans, J., Schneider, M., Buchmann, J., Vercauteren, F., & Preneel, B. (2010). Parallel shortest lattice vector enumeration on graphics cards. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6055 LNCS, pp. 52–68). https://doi.org/10.1007/978-3-642-12678-9_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
