### 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.

Available format(s)
Category
Implementation
Publication info
Published elsewhere. Unknown where it was published
Keywords
pairing-based cryptography
Contact author(s)
pbarreto @ larc usp br
History
Short URL
https://ia.cr/2004/032

CC BY

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},
note = {\url{https://eprint.iacr.org/2004/032}},
url = {https://eprint.iacr.org/2004/032}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.