Parallel Shortest Lattice Vector Enumeration on Graphics Cards

Parallel Shortest Lattice Vector Enumeration on Graphics Cards
复制标题

显卡上的并行最短格向量枚举

DOI：
--
复制
发表时间：
2010
期刊：
International Conference on Cryptology in Africa
影响因子：
--
通讯作者：
B. Preneel
B. Preneel
中科院分区：
--
文献类型：
--
作者：
J. Hermans;Michael Schneider;J. Buchmann;F. Vercauteren;B. Preneel

文献摘要

被引文献

相似文献

本文提出了一种在格上并行穷举搜索短向量的算法。该算法可应用于广泛的并行计算系统。为了说明该算法，它是使用CUDA（NVIDIA显卡的编程框架）在显卡上实现的。与以前的串行CPU实现相比，我们获得了很大的加速比。我们的实现在高晶格维度上快了近5倍。 穷举搜索是密码分析中格基约简的主要组成部分之一。我们的工作结果在实际的晶格约简的进步。
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.