复合扩张度有限域上的快速个体离散算法
Faster individual discrete logarithms in finite fields of composite extension degree
摘要:
计算有限域上的离散元是密码学中的一个主要问题。大中型特征领域的最佳算法(例如,{GF}$(p^2)$,{GF} $(p^{12})$)是数域筛及其变体(特殊、高度、塔)。小特征有限域中的最佳算法(例如,{GF}$(3^{6 \cdot 509})$)是函数域筛、Joux算法和准多项式时间算法。这类算法的最后一步是个体对数计算。它在两个阶段计算给定目标的平滑分解:初始分裂,然后是下降树。虽然已经进行了新的改进以降低主导关系集合和线性代数步骤的复杂性,从而导致更小的因子基(小元素的已知矩阵的数据库),但最后一步仍然保持相同的难度水平。实际上,我们必须找到有限域中一个典型的大元素的光滑分解。本文改进了初始分裂相,并适用于任何非素有限域。当扩张度为复合时,该算法是非常有效的。它利用适当的子场,导致目标的更平滑的分解。这导致了一个新的折衷之间的初始分裂步骤和下降步骤在小的特征。此外,它减少了随后的下降树的宽度和高度。
英文摘要:
Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms in large and medium characteristic fields (e.g., {GF}$(p^2)$, {GF}$(p^{12})$) are the Number Field Sieve and its variants (special, high-degree, tower). The best algorithms in small characteristic finite fields (e.g., {GF}$(3^{6 \cdot 509})$) are the Function Field Sieve, Joux's algorithm, and the quasipolynomial-time algorithm. The last step of this family of algorithms is the individual logarithm computation. It computes a smooth decomposition of a given target in two phases: an initial splitting, then a descent tree. While new improvements have been made to reduce the complexity of the dominating relation collection and linear algebra steps, resulting in a smaller factor basis (database of known logarithms of small elements), the last step remains at the same level of difficulty. Indeed, we have to find a smooth decomposition of a typically large element in the finite field. This work improves the initial splitting phase and applies to any nonprime finite field. It is very efficient when the extension degree is composite. It exploits the proper subfields, resulting in a much more smooth decomposition of the target. This leads to a new trade-off between the initial splitting step and the descent step in small characteristic. Moreover it reduces the width and the height of the subsequent descent tree.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。