Section: New Results

Faster individual discrete logarithms in finite fields of composite extension degree

Participant : Aurore Guillevic.

We improved in [7] the previous work [25] on speeding-up the first phase of the individual discrete logarithm computation, the initial splitting, a.k.a. the smoothing phase. We extended the algorithm to any non-prime finite field ${𝔽}_{p^n}$ where $n$ is composite. We also applied it to the new variant Tower-NFS. The paper is now published.