Cryptology ePrint Archive: Report 2004/032

Compressed Pairings

Michael Scott and Paulo S. L. M. Barreto

Abstract: Pairing-based cryptosystems rely on bilinear non-degenerate maps called pairings, such as the Tate and Weil pairings defined over certain elliptic curve groups. In this paper we show how to compress pairing values, how to couple this technique with that of point compression, and how to benefit from the compressed representation to speed up exponentiations involving pairing values, as required in many pairing based protocols.

Category / Keywords: implementation / pairing-based cryptography

Date: received 5 Feb 2004

Contact author: pbarreto at larc usp br

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20040205:222134 (All versions of this report)

Short URL: ia.cr/2004/032

Discussion forum: Show discussion | Start new discussion