Cryptology ePrint Archive: Report 2016/684

Available versions in chronological order


Faster individual discrete logarithms in non-prime finite fields with the NFS and FFS algorithms
Aurore Guillevic

Faster individual discrete logarithms with the QPA and NFS variants
Aurore Guillevic

Faster individual discrete logarithms in finite fields of composite extension degree
Aurore Guillevic
Original publication (in the same form): Mathematics of Computation, AMS

Faster individual discrete logarithms in finite fields of composite extension degree
Aurore Guillevic
Original publication (in the same form): Mathematics of Computation, AMS


[ Cryptology ePrint archive ]