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.
Type de document :
Pré-publication, Document de travail
Liste complète des métadonnées
Contributeur : Aurore Guillevic <>
Soumis le : lundi 23 mai 2016 - 23:50:39
Dernière modification le : mercredi 25 avril 2018 - 10:45:21


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01320496, version 1
  • ARXIV : 1605.07746


Aurore Guillevic, François Morain, Emmanuel Thomé. Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. 2016. 〈hal-01320496v1〉



Consultations de la notice


Téléchargements de fichiers