Paper 2009/601 Original: eprint.iacr.org/2009/601 ↗
Parallel Shortest Lattice Vector Enumeration on Graphics Cards
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.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2010-02-26: last updated
- 2009-12-09: published
- Short URL
- https://ia.cr/2009/601
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2009/601,
author = {Jens Hermans and Michael Schneider and Johannes Buchmann and Frederik Vercauteren and Bart Preneel},
title = {Parallel Shortest Lattice Vector Enumeration on Graphics Cards},
howpublished = {Cryptology {ePrint} Archive, Paper 2009/601},
year = {2009},
url = {https://eprint.iacr.org/2009/601}
}