Fixed Argument Pairings

Craig Costello; Douglas Stebila

Paper 2010/342

Fixed Argument Pairings

Craig Costello and Douglas Stebila

Abstract

A common scenario in many pairing-based cryptographic protocols is that one argument in the pairing is ﬁxed as a long term secret key or a constant parameter in the system. In these situations, the runtime of Miller’s algorithm can be signiﬁcantly reduced by storing precomputed values that depend on the ﬁxed argument, prior to the input or existence of the second argument. In light of recent developments in pairing computation, we show that the computation of the Miller loop can be sped up by up to 37% if precomputation is employed, with our method being up to 19.5% faster than the previous precomputation techniques.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Unknown where it was published
Keywords: Pairings Miller’s algorithm Tate pairing ate pairing precomputation.
Contact author(s): craig costello @ qut edu au
History: 2010-06-18: received
Short URL: https://ia.cr/2010/342
License: CC BY

BibTeX

@misc{cryptoeprint:2010/342,
      author = {Craig Costello and Douglas Stebila},
      title = {Fixed Argument Pairings},
      howpublished = {Cryptology {ePrint} Archive, Paper 2010/342},
      year = {2010},
      url = {https://eprint.iacr.org/2010/342}
}