Paper 2019/077

Pairing Implementation Revisited

Michael Scott

Abstract

Pairing-based cryptography is now a mature science. However implementation of a pairing-based protocol can be challenging, as the efficient computation of a pairing is difficult, and the existing literature on implementation might not match with the requirements of a particular application. Furthermore developments in our understanding of the true security of pairings render much of the existing literature redundant. Here we take a fresh look and develop a simpler three-stage algorithm for calculating pairings, as they arise in real applications.

Note: Footnote pointer to implementation

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Preprint. Minor revision.
Keywords
Pairing-based CryptographyImplementation
Contact author(s)
mike scott @ miracl com
History
2019-05-15: last of 2 revisions
2019-01-28: received
See all versions
Short URL
https://ia.cr/2019/077
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2019/077,
      author = {Michael Scott},
      title = {Pairing Implementation Revisited},
      howpublished = {Cryptology ePrint Archive, Paper 2019/077},
      year = {2019},
      note = {\url{https://eprint.iacr.org/2019/077}},
      url = {https://eprint.iacr.org/2019/077}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.