Location of Repository

Fixed argument pairings

By 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

Topics: 080402 Data Encryption, Pairings, Miller's algorithm, Tate pairing, ate pairing, precomputation
Publisher: Springer
Year: 2010
DOI identifier: 10.1007/978-3-642-14712-8_6
OAI identifier: oai:eprints.qut.edu.au:33711

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.