Cryptology ePrint Archive: Report 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.
Category / Keywords: Pairings, Millerís algorithm, Tate pairing, ate pairing, precomputation.
Date: received 15 Jun 2010, last revised 15 Jun 2010
Contact author: craig costello at qut edu au
Available format(s): PDF | BibTeX Citation
Version: 20100618:183424 (All versions of this report)
Short URL: ia.cr/2010/342
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]