International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Compressed Pairings

Authors:
Michael Scott
Paulo S. L. M. Barreto
Download:
URL: http://eprint.iacr.org/2004/032
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2004-12008,
  title={Compressed Pairings},
  booktitle={IACR Eprint archive},
  keywords={implementation / pairing-based cryptography},
  url={http://eprint.iacr.org/2004/032},
  note={ pbarreto@larc.usp.br 12453 received 5 Feb 2004},
  author={Michael Scott and Paulo S. L. M. Barreto},
  year=2004
}