Lattice Enumeration on GPUs for fplll [article]

Simon Pohmann, Marc Stevens, Jens Zumbrägel
2021 IACR Cryptology ePrint Archive  
The Kannan-Fincke-Pohst lattice enumeration algorithm is the classical method for solving the shortest vector problem in lattices. It is also a fundamental tool for most lattice reduction algorithms that provide speed-length tradeoffs. As this algorithm allows efficient parallel implementations, it is likely that implementing it on modern graphics processing units (GPUs) can significantly improve performance. We provide such an implementation that is compatible with the fplll lattice reduction
more » ... ibrary [fplll16] and achieves a considerable speedup in higher lattice dimensions, compared to current, multithreaded versions. For this, we use the CUDA technology that provides an abstract language for programming GPUs.
dblp:journals/iacr/PohmannSZ21 fatcat:bbt6mk6ucnad3axtwwe6djgfai