Faster individual discrete logarithms in finite fields of composite extension degree

Aurore Guillevic

Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms in large and medium characteristic fields (e.g., {GF}$(p^2)$, {GF}$(p^{12})$)…