Paper 2007/429 Original: eprint.iacr.org/2007/429 ↗
On compressible pairings and their computation
Abstract
In this paper we provide explicit formul\ae\ to compute bilinear pairings in compressed form. We indicate families of curves where the proposed compressed computation method can be applied and where particularly generalized versions of the Eta and Ate pairings due to Zhao \emph{et al.} are especially efficient. Our approach introduces more flexibility when trading off computation speed and memory requirement. Furthermore, compressed computation of reduced pairings can be done without any finite field inversions. We also give a performance evaluation and compare the new method with conventional pairing algorithms.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2008-03-14: last updated
- 2007-11-18: published
- Short URL
- https://ia.cr/2007/429
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2007/429,
author = {Michael Naehrig and Paulo S. L. M. Barreto and Peter Schwabe},
title = {On compressible pairings and their computation},
howpublished = {Cryptology {ePrint} Archive, Paper 2007/429},
year = {2007},
url = {https://eprint.iacr.org/2007/429}
}