TY - JOUR
T1 - Efficient Pairing Computation on Huff Curves
AU - Gu, Haihua
AU - Gu, Dawu
AU - Xie, Wenlu
AU - Cheung, Ray C. C.
PY - 2015/7/3
Y1 - 2015/7/3
N2 - Abstract: Pairings on elliptic curves are currently of great interest due to their applications in a number of cryptographic protocols such as identity-based encryption, group signatures, short signatures, and the tripartite Diffie-Hellman. Miller's algorithm is the most commonly used method of computing Tate pairing. Denominator elimination can improve Miller's algorithm when the embedding degree has the form 2i3j. However, if the embedding degree does not have the above form, how can the speed of Miller's algorithm be increased? In this article, the authors modified Miller's algorithm over Huff curves. It is about 20.38% faster than the original algorithm.
AB - Abstract: Pairings on elliptic curves are currently of great interest due to their applications in a number of cryptographic protocols such as identity-based encryption, group signatures, short signatures, and the tripartite Diffie-Hellman. Miller's algorithm is the most commonly used method of computing Tate pairing. Denominator elimination can improve Miller's algorithm when the embedding degree has the form 2i3j. However, if the embedding degree does not have the above form, how can the speed of Miller's algorithm be increased? In this article, the authors modified Miller's algorithm over Huff curves. It is about 20.38% faster than the original algorithm.
KW - elliptic curves
KW - Huff curves
KW - pairing
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84936846969&origin=recordpage
UR - http://www.scopus.com/inward/record.url?scp=84936846969&partnerID=8YFLogxK
U2 - 10.1080/01611194.2014.915259
DO - 10.1080/01611194.2014.915259
M3 - RGC 21 - Publication in refereed journal
SN - 0161-1194
VL - 39
SP - 270
EP - 275
JO - Cryptologia
JF - Cryptologia
IS - 3
ER -