arXiv · 1805.00093
A new perspective on the powers of two descent for discrete logarithms in finite fields
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.
Explore related subjects
Keep this discovery
Thorsten Kleinjung, Benjamin Wesolowski. 2018-04-30. A new perspective on the powers of two descent for discrete logarithms in finite fields. https://doi.org/10.2140/obs.2019.2.343
Cite the original work for its findings. Save a collection to share your selection of sources.