Asymptotic Complexities of Discrete Logarithm Algorithms in Pairing-Relevant Finite Fields.

Gabrielle De Micheli, Pierrick Gaudry, Ccile Pierrot

Browse the full CRYPTO paper archive.