Welcome to the resource topic for 2019/751
Title:
Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
Authors: Thorsten Kleinjung, Benjamin Wesolowski
Abstract:We prove that the discrete logarithm problem can be solved in quasi-polynomial expected time in the multiplicative group of finite fields of fixed characteristic. More generally, we prove that it can be solved in the field of cardinality p^n in expected time (pn)^{2\log_2(n) + O(1)}.
ePrint: https://eprint.iacr.org/2019/751
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 .