Compressed Pairings

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.

• Type: Conference
• Year: 2004
• Where: CRYPTO
• Authors: Michael Scott, Paulo S. L. M. Barreto
• Keywords: Certain Elliptic Curve, CRYPTO 2004, Maps Called Pairings, Pairing