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 &#64257;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&#64257;cantly reduced by storing precomputed values that depend on the &#64257;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.

Available format(s)
Publication info
Published elsewhere. Unknown where it was published
Keywords
PairingsMiller’s algorithmTate pairingate pairingprecomputation.
Contact author(s)
craig costello @ qut edu au
History
Short URL
https://ia.cr/2010/342

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},
note = {\url{https://eprint.iacr.org/2010/342}},
url = {https://eprint.iacr.org/2010/342}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.