@inproceedings{7ea0f1aa4add45419559ce72b6e29483,
title = "Computing discrete logarithms in Fp6 ",
abstract = "The security of torus-based and pairing-based cryptography relies on the difficulty of computing discrete logarithms in small degree extensions of finite fields of large characteristic. It has already been shown that for degrees 2 and 3, the discrete logarithm problem is not as hard as once thought. We address the question of degree 6 and aim at providing real-life timings for such problems. We report on a record DL computation in a 132-bit subgroup of Fp6 for a 22-decimal digit prime, with p6 having 422 bits. The previous record was for a 79-bit subgroup in a 240-bit field. We used NFS-DL with a sieving phase over degree 2 polynomials, instead of the more classical degree 1 case. We show how to improve many parts of the NFS-DL algorithm to reach this target.",
author = "Laurent Gr{\'e}my and Aurore Guillevic and Fran{\c c}ois Morain and Emmanuel Thom{\'e}",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2018.; 24th International Conference on Selected Areas in Cryptography, SAC 2017 ; Conference date: 16-08-2017 Through 18-08-2017",
year = "2018",
month = jan,
day = "1",
doi = "10.1007/978-3-319-72565-9\_5",
language = "English",
isbn = "9783319725642",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "85--105",
editor = "Carlisle Adams and Jan Camenisch",
booktitle = "Selected Areas in Cryptography {\textendash} SAC 2017 - 24th International Conference, Revised Selected Papers",
}