Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic

Thorsten Kleinjung, Benjamin Wesolowski

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, w…