Cryptology ePrint Archive: Report 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.

Category / Keywords: implementation / Pairing-based Cryptography, Implementation

Date: received 23 Jan 2019, last revised 10 Feb 2019

Contact author: mike scott at miracl com

Available format(s): PDF | BibTeX Citation

Note: Footnote pointer to implementation

Version: 20190210:113521 (All versions of this report)

Short URL: ia.cr/2019/077


[ Cryptology ePrint archive ]