A Simplified Approach to Rigorous Degree 2 Elimination in Discrete Logarithm Algorithms.
MATHEMATICS OF COMPUTATION(2019)
摘要
In this paper, we revisit the ZigZag strategy of Granger, Kleinjung, and Zumbragel. In particular, we provide a new algorithm and proof for the so-called degree 2 elimination step. This allows us to provide a stronger theorem concerning discrete logarithm computations in small characteristic fields F-qk0k with k close to q and k(0) a small integer. As in the aforementioned paper, we rely on the existence of two polynomials h(0) and h(1) of degree 2 providing a convenient representation of the finite field F-qk0k.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络