Parallel Shortest Lattice Vector Enumeration on Graphics Cards

DOI10.1007/978-3-642-12678-9_4zbMath1284.68638OpenAlexW1490056131MaRDI QIDQ3558303

Jens Hermans, Frederik Vercauteren, Bart Preneel, Michael Schneider, Johannes A. Buchmann

Publication date: 4 May 2010

Published in: Progress in Cryptology – AFRICACRYPT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12678-9_4

zbMATH Keywords

parallelizationCUDAexhaustive searchlattice reductiongraphics cardsENUM

Mathematics Subject Classification ID

Cryptography (94A60) Parallel algorithms in computer science (68W10)

Related Items (4)

Development and analysis of massive parallelization of a lattice basis reduction algorithm ⋮ Algorithms for the Shortest and Closest Lattice Vector Problems ⋮ Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices ⋮ A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices

Uses Software

• CUDA
• SWIFFT
• NTRU

This page was built for publication: Parallel Shortest Lattice Vector Enumeration on Graphics Cards