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

Journal of Algorithms

Volumn 58, Issue 2, 2006, Pages 134-149

  Blake, Ian F ^a   Kumar Murty, V ^a   Xu, Guangwu ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Algorithm; Cryptography; Elliptic curves; Tate pairing; Weil pairing

Indexed keywords

CRYPTOGRAPHY; NETWORK PROTOCOLS;

ELLIPTIC CURVES; MILLER'S ALGORITHM; TATE PAIRING; WEIL PAIRING;

ALGORITHMS;

EID: 29144477624     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2005.01.009     Document Type: Article

References (18)

1. P.S.L.M. Barreto, H.Y. Kim, B. Lynn, and M. Scott Efficient algorithms for pairing-based cryptosystems Advances in Cryptology CRYPTO'02, Santa Barbara, CA, 2002 M. Yung Lecture Notes in Comput. Sci. vol. 2442 2002 Springer Heidelberg 354 368
2. I.F. Blake, G. Seroussi, and N.P. Smart Elliptic Curves in Cryptography 1999 Cambridge University Press Cambridge
3. I.F. Blake, V.K. Murty, and G. Xu Efficient algorithms for Koblitz curves over fields of characteristic three J. Discrete Algorithms 2005 in press
4. D. Boneh, and M. Franklin Identity-based encryption from the Weil pairing Advances in Cryptology, Crypt'01 J. Kilian Lecture Notes in Comput. Sci. vol. 2139 2001 Springer Heidelberg 213 239
5. D. Boneh, B. Lynn, and H. Shacham Short signatures from the Weil pairing Advances in Cryptology, Asiacrypt'01 C. Boyd Lecture Notes in Comput. Sci. vol. 2248 2001 Springer Heidelberg 514 532
6. G. Frey, and H.G. Rück A remark concerning m-divisibility and the discrete logarithm in divisor class group of curves Math. Comp. 62 1994 865 874
7. S. Galbraith, K. Harrison, and D. Soldera Implementing the Tate pairing Algorithm Number Theory Symposium, ANTS-V C. Fieker D. Kohel Lecture Notes in Comput. Sci. vol. 2369 2002 Springer Heidelberg 324 337
8. A. Joux A one round protocol for tripartite Diffie-Hellman Algorithmic Number Theory Symposium, ANTS-IV W. Bosma Lecture Notes in Comput. Sci. vol. 1838 2000 Springer Heidelberg 385 393
9. K. Eisenträger, K. Lauter, and P.L. Montgomery Fast elliptic curve arithmetic and improved Weil pairing evaluation Topics in Cryptology, CT-RSA'03 Lecture Notes in Comput. Sci. vol. 2612 2003 Springer Heidelberg 343 354
10. K. Eisenträger, K. Lauter, and P.L. Montgomery Improved Weil and Tate pairings for elliptic and hyperelliptic curves Algorithmic Number Theory Symposium, ANTS-VI Lecture Notes in Comput. Sci. vol. 3076 2004 Springer Heidelberg 169 183
11. N. Koblitz Elliptic curve cryptosystems Math. Comp. 48 1987 203 209
12. N. Koblitz An elliptic curves implementation of the finite field digital signature algorithm Advances in Cryptology, CRYPTO'98 Lecture Notes in Comput. Sci. vol. 1462 1998 Springer Heidelberg 327 337
13. A.J. Menezes, T. Okamoto, and S.A. Vanstone Reducing elliptic curve logarithms to logarithms in a finite field IEEE Trans. Inform. Theory 39 1993 1639 1646
14. V. Miller, Short programs for functions on curves, unpublished manuscript, 1986
15. V. Miller Uses of elliptic curves in cryptography Advances in Cryptology, CRYPTO'85 Lecture Notes in Comput. Sci. vol. 218 1986 Springer Heidelberg 417 462
16. R. Sakai, K. Ohgishi, M. Kasahara, Cryptosystems based on pairing, in: 2000 Symposium on Cryptography and Information Security, SCIS-2000, Okinawa, Japan, 2000
17. A. Shamir Identity-based cryptosystems and signature schemes Advances in Cryptology, Crypto'84 Lecture Notes in Comput. Sci. vol. 196 1984 Springer Heidelberg 47 53
18. J.H. Silverman The Arithmetic of Elliptic Curves Grad. Texts in Math. vol. 106 1986 Springer New York