@inproceedings{752716871fdb4eeeb48092e47078b96b,
title = "Solving Discrete Logarithms on a 170-Bit MNT Curve by Pairing Reduction",
abstract = "Pairing based cryptography is in a dangerous position following the breakthroughs on discrete logarithms computations in finite fields of small characteristic. Remaining instances are built over finite fields of large characteristic and their security relies on the fact the embedding field of the underlying curve is relatively large. How large is debatable. The aim of our work is to sustain the claim that the combination of degree 3 embedding and too small finite fields obviously does not provide enough security. As a computational example, we solve the DLP on a 170-bit MNT curve, by exploiting the pairing embedding to a 508-bit, degree-3 extension of the base field.",
keywords = "Discrete logarithm, Finite field, MNT elliptic curve, Number Field Sieve",
author = "Aurore Guillevic and Fran{\c c}ois Morain and Emmanuel Thom{\'e}",
note = "Publisher Copyright: {\textcopyright} 2017, Springer International Publishing AG.; 23rd International Conference on Selected Areas in Cryptography, SAC 2016 ; Conference date: 10-08-2016 Through 12-08-2016",
year = "2017",
month = jan,
day = "1",
doi = "10.1007/978-3-319-69453-5\_30",
language = "English",
isbn = "9783319694528",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "559--578",
editor = "Roberto Avanzi and Howard Heys",
booktitle = "Selected Areas in Cryptography – SAC 2016 - 23rd International Conference, Revised Selected Papers",
}