Computing Individual Discrete Logarithms Faster in GF$(p^n)$ with the NFS-DL Algorithm

Aurore Guillevic

The Number Field Sieve (NFS) algorithm is the best known method to compute discrete logarithms (DL) in finite fields $\mathbb{F}\_p^n$, with $p$ medium to large and $n\ge 1$ sm…