用GPU加速离散对数问题的迭代SpMV
Accelerating Iterative SpMV for Discrete Logarithm Problem Using GPUs
摘要:
在密码分析的背景下,使用基于索引演算的方法(例如数域筛子或函数域筛子)计算大型循环群中的离散矩阵需要求解以群阶为模的大型稀疏线性方程组。大多数用于求解此类系统的快速算法-例如,共轭梯度或Lanczos和Wiedemann算法-求相应稀疏矩阵与向量的乘积(SpMV)。这种中央操作可以使用特定的计算模型和寻址模式在GPU上加速,这增加了算术强度,同时减少了不规则的内存访问。在这项工作中,我们研究了SpMV内核在NVIDIA GPU上的实现,用于存储器中稀疏矩阵的几种表示。我们探索使用剩余数系统(RNS)算法来加速模运算。我们的目标是线性系统时产生的攻击的离散对数问题的大小为100至1000位,其中包括当前密码分析计算的相关范围。所提出的SpMV实现有助于使用FFS算法解决GF($2^{619}$)和GF($2^{809}$)中的离散对数问题。
英文摘要:
In the context of cryptanalysis, computing discrete logarithms in large cyclic groups using index-calculus-based methods, such as the number field sieve or the function field sieve, requires solving large sparse systems of linear equations modulo the group order. Most of the fast algorithms used to solve such systems --- e.g., the conjugate gradient or the Lanczos and Wiedemann algorithms --- iterate a product of the corresponding sparse matrix with a vector (SpMV). This central operation can be accelerated on GPUs using specific computing models and addressing patterns, which increase the arithmetic intensity while reducing irregular memory accesses. In this work, we investigate the implementation of SpMV kernels on NVIDIA GPUs, for several representations of the sparse matrix in memory. We explore the use of Residue Number System (RNS) arithmetic to accelerate modular operations. We target linear systems arising when attacking the discrete logarithm problem on groups of size 100 to 1000 bits, which includes the relevant range for current cryptanalytic computations. The proposed SpMV implementation contributed to solving the discrete logarithm problem in GF($2^{619}$) and GF($2^{809}$) using the FFS algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。