12 citations · 38 across the 6 of their papers we have counts for
4 papers · 1 filter
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic +3
We report on two new records: the factorization of RSA-240, a 795-bit number, and a discrete logarithm computation over a 795-bit prime field. Previous records were the factorizati…
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}, {GF})…
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
Aurore Guillevic, François Morain, Emmanuel Thomé
Pairing based cryptography is in a dangerous position following the breakthroughs on discrete logarithms computations in finite fields of small characteristic. Remaining instances…
Computing Individual Discrete Logarithms Faster in GF 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 , with medium to large and sm…