You are looking at a specific version 20080314:155727 of this paper. See the latest version.

Paper 2007/429

On compressible pairings and their computation

Michael Naehrig and Paulo S. L. M. Barreto and Peter Schwabe

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.

Note: Included implementation and timing results.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
pairing-based cryptographycompressible pairingsalgebraic toriTate pairingEta pairingAte pairingtwists
Contact author(s)
mnaehrig @ ti rwth-aachen de
History
2008-03-14: revised
2007-11-18: received
See all versions
Short URL
https://ia.cr/2007/429
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.