Cryptology ePrint Archive: Report 2013/722

The Realm of the Pairings

Diego F. Aranha and Paulo S. L. M. Barreto and 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.

Category / Keywords: implementation / bilinear pairings

Original Publication (in the same form): SAC 2013

Date: received 4 Nov 2013, last revised 7 Apr 2014

Contact author: dfaranha at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20140407:201234 (All versions of this report)

Short URL: ia.cr/2013/722

Discussion forum: Show discussion | Start new discussion