Refinements of Miller's algorithm for computing the Weil/Tate pairing

Authors:
Ian F. Blake;V. Kumar Murty;Guangwu Xu
Affiliations:
Department of Electrical and Computer Engineering, University of Toronto, Toronto, Ontario, Canada;Department of Mathematics, University of Toronto, Toronto, Ontario, Canada;Ganita Lab, University of Toronto at Mississauga, Mississauga, Ontario, Canada
Venue:
Journal of Algorithms
Year:
2006

Citing 9
Cited 0

Identity-based cryptosystems and signature schemes

Proceedings of CRYPTO 84 on Advances in cryptology
A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves

Mathematics of Computation
Elliptic curves in cryptography

Elliptic curves in cryptography
Efficient Algorithms for Pairing-Based Cryptosystems

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Use of Elliptic Curves in Cryptography

CRYPTO '85 Advances in Cryptology
An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A One Round Protocol for Tripartite Diffie-Hellman

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Implementing the Tate Pairing

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Fast elliptic curve arithmetic and improved weil pairing evaluation

CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track

Quantified Score

Hi-index	0.00

Visualization

Abstract

The efficient computation of the Weil and Tate pairings is of significant interest in the implementation of certain recently developed cryptographic protocols. The standard method of such computations has been the Miller algorithm. Three refinements to Miller's algorithm are given in this work. The first refinement is an overall improvement. If the binary expansion of the involved integer has relatively high Hamming weight, the second improvement suggested shows significant gains. The third improvement is especially efficient when the underlying elliptic curve is over a finite field of characteristic three, which is a case of particular cryptographic interest. Comment on the performance analysis and characteristics of the refinements are given.