Compressed Pairings

Michael Scott; Paulo S.  L.  M.  Barreto

Paper 2004/032 Original: eprint.iacr.org/2004/032 ↗

Compressed Pairings

Michael Scott

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.

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Preprint.
History: 2004-02-05: last updated; 2004-02-05: published
Short URL: https://ia.cr/2004/032
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2004/032,
      author = {Michael Scott and Paulo S.  L.  M.  Barreto},
      title = {Compressed Pairings},
      howpublished = {Cryptology {ePrint} Archive, Paper 2004/032},
      year = {2004},
      url = {https://eprint.iacr.org/2004/032}
}