A brief history of pairings

Razvan Barbulescu (1, 2, 3)

1 CNRS - Centre National de la Recherche Scientifique
2 UPMC - Université Pierre et Marie Curie - Paris 6
3 UPD7 - Université Paris Diderot - Paris 7

Pairings are a relatively new tool in cryptography. Recent progress on the attack algorithms have changed the security estimations. We make a list of pairing families and explain their advantages but also their weaknesses.

Mots clés: pairings; elliptic curves; finite fields

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

Razvan Barbulescu. A brief history of pairings. International Workshop on the Arithmetic of Finite Fields WAIFI 2016, Université de Gand, Jul 2016, Gand, Belgium. ⟨hal-01363444⟩