Welcome to the resource topic for 2009/601
Title:
Parallel Shortest Lattice Vector Enumeration on Graphics Cards
Authors: Jens Hermans, Michael Schneider, Johannes Buchmann, Frederik Vercauteren, Bart Preneel
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.
ePrint: https://eprint.iacr.org/2009/601
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .