A provably quasi-polynomial algorithm for the discrete logarithm problem in finite fields of small characteristic

Guido Lido

We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose…