Solving discrete logarithms on a 170-bit MNT curve by pairing reduction - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2016

Solving discrete logarithms on a 170-bit MNT curve by pairing reduction

Résumé

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.
Fichier principal
Vignette du fichier
mnt-p3-paper.hal.pdf (452.78 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01320496 , version 1 (23-05-2016)
hal-01320496 , version 2 (24-11-2016)

Identifiants

Citer

Aurore Guillevic, François Morain, Emmanuel Thomé. Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. 2016. ⟨hal-01320496v1⟩
869 Consultations
343 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More