2 papers
cs.CR2020
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…
cs.CR2018
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})…