[Resource Topic] 2004/032: Compressed Pairings

Welcome to the resource topic for 2004/032

Compressed Pairings

Authors: Michael Scott, Paulo S. L. M. Barreto


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.

ePrint: https://eprint.iacr.org/2004/032

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .