Paper 2013/722

The Realm of the Pairings

Diego F. Aranha, Paulo S. L. M. Barreto, Patrick Longa, and Jefferson E. Ricardini

Abstract

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.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Published elsewhere. SAC 2013
Keywords
bilinear pairings
Contact author(s)
dfaranha @ gmail com
History
2014-04-07: last of 7 revisions
2013-11-07: received
See all versions
Short URL
https://ia.cr/2013/722
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2013/722,
      author = {Diego F.  Aranha and Paulo S.  L.  M.  Barreto and Patrick Longa and Jefferson E.  Ricardini},
      title = {The Realm of the Pairings},
      howpublished = {Cryptology ePrint Archive, Paper 2013/722},
      year = {2013},
      note = {\url{https://eprint.iacr.org/2013/722}},
      url = {https://eprint.iacr.org/2013/722}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.