Implementing cryptographic pairings at standard security levels - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Implementing cryptographic pairings at standard security levels

Jérôme Milan
  • Function : Author
  • PersonId : 844426


This study reports on an implementation of cryptographic pairings in a general purpose computer algebra system. For security levels equivalent to the different AES flavours, we exhibit suitable curves in parametric families and show that optimal ate and twisted ate pairings exist and can be efficiently evaluated. We provide a correct description of Miller's algorithm for signed binary expansions such as the NAF and extend a recent variant due to Boxall et al. to addition-subtraction chains. We analyse and compare several algorithms proposed in the literature for the final exponentiation. Finally, we give recommendations on which curve and pairing to choose at each security level.
Fichier principal
Vignette du fichier
pairings.pdf (264.73 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01034213 , version 1 (22-07-2014)



Andreas Enge, Jérôme Milan. Implementing cryptographic pairings at standard security levels. Security, Privacy, and Applied Cryptography Engineering, Oct 2014, Pune, India. pp.28-46, ⟨10.1007/978-3-319-12060-7_3⟩. ⟨hal-01034213⟩
607 View
364 Download



Gmail Facebook X LinkedIn More