Paper 2010/342

Fixed Argument Pairings

Craig Costello and Douglas Stebila


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.

Available format(s)
Publication info
Published elsewhere. Unknown where it was published
PairingsMiller’s algorithmTate pairingate pairingprecomputation.
Contact author(s)
craig costello @ qut edu au
2010-06-18: received
Short URL
Creative Commons Attribution


      author = {Craig Costello and Douglas Stebila},
      title = {Fixed Argument Pairings},
      howpublished = {Cryptology ePrint Archive, Paper 2010/342},
      year = {2010},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.