Updating key size estimations for pairings

Razvan Barbulescu (1, 2) , Sylvain Duquesne (3)

1 IMJ-PRG (UMR_7586) - Institut de Mathématiques de Jussieu - Paris Rive Gauche
2 OURAGAN - OUtils de Résolution Algébriques pour la Géométrie et ses ApplicatioNs
3 IRMAR - Institut de Recherche Mathématique de Rennes

Recent progress on NFS imposed a new estimation of the security of pairings. In this work we study the best attacks against some of the most popular pairings. It allows us to propose new pairing-friendly curves of 128 bits and 192 bits of security.

Mots clés: Pairing-based cryptology; Discrete logarithm; Number field sieve

Domaines: Cryptographie et sécurité [cs.CR]

Razvan Barbulescu, Sylvain Duquesne. Updating key size estimations for pairings. Journal of Cryptology, 2019, 32 (4), pp.1298--1336. ⟨10.1007/s00145-018-9280-5⟩. ⟨hal-01534101v2⟩