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 that 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 :
Communication dans un congrès
Roberto Avanzi and Howard Heys. Selected Areas in Cryptography 2016, Aug 2016, St. John's, Canada. Springer, Selected Areas in Cryptography 2016. <http://www.engr.mun.ca/~sac2016/>
Liste complète des métadonnées

https://hal.inria.fr/hal-01320496
Contributeur : Aurore Guillevic <>
Soumis le : jeudi 24 novembre 2016 - 11:40:35
Dernière modification le : samedi 18 février 2017 - 01:13:47

Identifiants

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

Citation

Aurore Guillevic, François Morain, Emmanuel Thomé. Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. Roberto Avanzi and Howard Heys. Selected Areas in Cryptography 2016, Aug 2016, St. John's, Canada. Springer, Selected Areas in Cryptography 2016. <http://www.engr.mun.ca/~sac2016/>. <hal-01320496v2>

Partager

Métriques

Consultations de
la notice

329

Téléchargements du document

83