Implementing cryptographic pairings at standard security levels

Andreas Enge 1, 2 Jérôme Milan 3
1 LFANT - Lithe and fast algorithmic number theory
IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
3 TANC - Algorithmic number theory for cryptology
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR7161
Abstract : 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.
Type de document :
Communication dans un congrès
Rajat Subhra Chakraborty, Vashek Matyas, Patrick Schaumont. Security, Privacy, and Applied Cryptography Engineering, Oct 2014, Pune, India. Springer, 8804, pp.28-46, Lecture Notes in Computer Science. 〈10.1007/978-3-319-12060-7_3〉
Liste complète des métadonnées

Littérature citée [22 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01034213
Contributeur : Andreas Enge <>
Soumis le : mardi 22 juillet 2014 - 18:41:56
Dernière modification le : jeudi 12 avril 2018 - 01:49:21
Document(s) archivé(s) le : mardi 25 novembre 2014 - 11:40:44

Fichiers

pairings.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Andreas Enge, Jérôme Milan. Implementing cryptographic pairings at standard security levels. Rajat Subhra Chakraborty, Vashek Matyas, Patrick Schaumont. Security, Privacy, and Applied Cryptography Engineering, Oct 2014, Pune, India. Springer, 8804, pp.28-46, Lecture Notes in Computer Science. 〈10.1007/978-3-319-12060-7_3〉. 〈hal-01034213〉

Partager

Métriques

Consultations de la notice

631

Téléchargements de fichiers

425