Welcome to the resource topic for
**2018/647**

**Title:**

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

**Authors:**
Thorsten Kleinjung, Benjamin Wesolowski

**Abstract:**

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.

**ePrint:**
https://eprint.iacr.org/2018/647

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

**Example resources include:**
implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .