Fixed argument pairings
Contribuinte(s) |
Abdalla, Michel Barreto, Paulo S.L.M. |
---|---|
Data(s) |
01/08/2010
|
Resumo |
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. |
Formato |
application/pdf |
Identificador | |
Publicador |
Springer |
Relação |
http://eprints.qut.edu.au/33711/1/c33711.pdf DOI:10.1007/978-3-642-14712-8_6 Costello, Craig & Stebila, Douglas (2010) Fixed argument pairings. In Abdalla, Michel & Barreto, Paulo S.L.M. (Eds.) Progress in Cryptology -- LATINCRYPT 2010, Springer, Puebla, Mexico, pp. 92-108. |
Direitos |
Copyright 2010 Springer This is the author-version of the work. Conference proceedings published, by Springer Verlag, will be available via SpringerLink http://www.springer.de/comp/lncs/ |
Fonte |
Information Security Institute |
Palavras-Chave | #080402 Data Encryption #Pairings #Miller's algorithm #Tate pairing #ate pairing #precomputation |
Tipo |
Conference Paper |