International Association for Cryptologic Research

International Association
for Cryptologic Research


Paper: Fixed Argument Pairings

Craig Costello
Douglas Stebila
Search ePrint
Search Google
Abstract: A common scenario in many pairing-based cryptographic protocols is that one argument in the pairing is fixed as a long term secret key or a constant parameter in the system. In these situations, the runtime of Miller’s algorithm can be significantly reduced by storing precomputed values that depend on the fixed 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.
  title={Fixed Argument Pairings},
  booktitle={IACR Eprint archive},
  keywords={Pairings, Miller’s algorithm, Tate pairing, ate pairing, precomputation.},
  note={ 14775 received 15 Jun 2010, last revised 15 Jun 2010},
  author={Craig Costello and Douglas Stebila},