Diego F. Aranha, Paulo S.L.M. Barreto, Patrick Longa, and Jefferson E. Ricardini
Bilinear maps, or pairings, initially proposed in a cryptologic context for cryptanalytic purposes, proved afterward to be an amazingly flexible and useful tool for the construction of cryptosystems with unique features. Yet, they are notoriously hard to implement efficiently, so that their effective deployment requires a careful choice of parameters and algorithms. In this paper we review the evolution of pairing-based cryptosystems, the development of efficient algorithms and the state of the art in pairing computation, and the challenges yet to be addressed on the subject, while also presenting some new algorithmic and implementation refinements in affine and projective coordinates.
|Published in||Selected Areas in Cryptography (SAC 2013)|
|Publisher||Lecture Notes in Computer Science|