François Morain

Breaking DLP in $GF(p^5)$ using 3-dimensional sieving

2017 · HAL (Le Centre pour la Communication Scientifique Directe)

We report on a discrete logarithm computation in $GF(p^5)$ for a 20-decimal digit prime, using the number field sieve algorithm (NFS-DL), and a relation collection phase over degree-two polynomials, instead of the more classical degree-one …