论文信息 - A new perspective on the powers of two descent for discrete logarithms in finite fields

A new perspective on the powers of two descent for discrete logarithms in finite fields

A new proof is given for the correctness of the powers of two descent method for computing discrete logarithms. The result is slightly stronger than the original work, but more importantly we provide a unified geometric argument, eliminating the need to analyse all possible subgroups of $\mathrm{PGL}_2(\mathbb F_q)$. Our approach sheds new light on the role of $\mathrm{PGL}_2$, in the hope to eventually lead to a complete proof that discrete logarithms can be computed in quasi-polynomial time in finite fields of fixed characteristic.

Thorsten Kleinjung | Benjamin Wesolowski | B. Wesolowski | T. Kleinjung

[1] C. Diem. On the discrete logarithm problem in elliptic curves , 2010, Compositio Mathematica.

[2] Antoine Joux,et al. A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic , 2013, Selected Areas in Cryptography.

[3] Eric Bach,et al. Weil bounds for singular curves , 1996, Applicable Algebra in Engineering, Communication and Computing.

[4] P. Gaudry,et al. A general framework for subexponential discrete logarithm algorithms , 2002 .

[5] Daqing Wan,et al. Generators and irreducible polynomials over finite fields , 1997, Math. Comput..

[6] Faruk Göloglu,et al. On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in F21971 , 2013, IACR Cryptol. ePrint Arch..

[7] Thorsten Kleinjung,et al. On the discrete logarithm problem in finite fields of fixed characteristic , 2015, IACR Cryptol. ePrint Arch..