Efficient computations of the tate pairing for the large MOV degrees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2587, Issue , 2003, Pages 283-297

  Izu, Tetsuya ^a   Takagi, Tsuyoshi ^b  

^a FUJITSU LABORATORIES LTD   (Japan)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Efficient computation; Elliptic curve cryptosystem; Jacobian coordinate; MOV degree; Tate pairing

Indexed keywords

EID: 35248849357     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36552-4_20     Document Type: Article

References (28)

1. D. Boneh, and M. Franklin, "Identity-based encryption from the Weil pairing", CRYPTO 2001, LNCS 2139, pp.213-229, Springer-Verlag, 2001.
2. P. Barreto, H. Kim, B. Lynn, and M. Scott, "Efficient Algorithms for Pairing-Based Cryptosystems", CRYPTO 2002, LNCS 2442, pp.354-368, Springer-Verlag, 2002.
3. D. Boneh, B. Lynn, and H. Shacham, "Short Signatures from the Weil Pairing", ASIACRYPT 2001, LNCS 2248, pp.514-532, Springer-Verlag, 2001.
4. n)", STOC 1984, pp.201-207, 1983.
5. H. Cohen, A. Miyaji and T. Ono, "Efficient elliptic curve exponentiation using mixed coordinates", Asiacrypt'98, LNCS 1514, pp.51-65, Springer-Verlag, 1998.
6. R. Dunport, A. Enge, and F. Morain, "Building curves with arbitrary small MOV degree over finite prime fields", Cryptology ePrint Archive, Report 2002/094, 2002.
7. G. Frey, M. Müller, and H. Rück, "The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems", IEEE Trans. on Information Theory, vol.45, pp.1717-1718, 1999.
8. S.D. Galbraith, "Supersingular Curves in Cryptography", Asiacrypt 2001, LNCS 2248, pp.495-513, Springer-Verlag, 2001.
9. S. D. Galbraith, K. Harrison, and D. Soldera, "Implementing the Tate pairing", ANTS V, LNCS 2369, pp.324-337, Springer-Verlag, 2002.
10. F. Hess, "Exponent Group Signature Schemes and Efficient Identity Based Signature Schemes Based on Pairings", Cryptology ePrint Archive, Report 2002/012, 2002.
11. IEEE P1363, Standard Specifications for Public-Key Cryptography, 2000.
12. K. Itoh, M. Takenaka, N. Torii, S. Temma, and Y. Kurihara, "Fast Implementation of Public-Key Cryptography on DSP TMS320C6201", CHES'99, LNCS 1717, pp.61-72, 1999.
13. A. Joux, "A One Round Protocol for Tripartite Diffie-Hellman", ANTS IV, LNCS 1838, pp.385-393, Springer-Verlag, 2000.
14. A. Joux, "The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems (survey)", ANTS V, LNCS 2369, pp.20-32, Springer-Verlag, 2002.
15. N. Koblitz, "Elliptic curve cryptosystems", Math. of Comp., vol.48, pp.203-209, 1987.
16. A. Menezes, "Elliptic Curve Public Key Cryptosystems", Kluwer Academic Publishers, 1993.
17. V. Miller, "Use of elliptic curves in cryptography", CRYPTO'85, LNCS 218. p.417-426, Springer-Verlag, 1986.
18. A. Miyaji, M. Nakabayashi, and S. Takano, "New explicit conditions of elliptic curve traces for FR-reduction", IEICE Trans. Fundamentals, E84-A(5), May, 2001.
19. A. Menezes, T. Okamoto, and S. Vanstone, "Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field", IEEE Trans. on Information Theory, vol.39, pp.1639-1646, 1993.
20. National Institute of Standards and Technology, Recommended Elliptic Curves for Federal Government Use, in the appendix of FIPS 186-2.
21. T. Okamoto, P. Pointcheval, "The Gap Problems: a new class of problems for the security of cryptographic primitives", PKC 2001, LNCS 1992, pp.104-118, Springer-Verlag, 2001.
22. K.G. Paterson, "ID-based Signatures from Pairings on Elliptic Curves", Cryptology ePrint Archive, Report 2002/004, 2002.
23. D. Page, and N. Smart, "Hardware Implementation of Finite Fields of Characteristic Three", to appear in the proceedings of CHES 2002.
24. N. P. Smart, "An Identity Based Authentificated Key Agreement Protocol Based on the Weil Pairing", Cryptology ePrint Archive, Report 2001/111, 2001.
25. Standards for Efficient Cryptography Group (SECG), Specification of Standards for Efficient Cryptography. http://www.secg.org.
26. R. Sakai, K. Ohgishi, and M. Kasahara, "Cryptosystems Based on Pairing", 2000 Symposium on Cryptography and Information Security (SCIS 2000), Okinawa, Japan, Jan. 26-28, 2000.
27. N. P. Smart, and J. Westwood, "Point Multiplication on Ordinary Elliptic Curves over Fields of Characteristic Three", Cryptology ePrint Archive, Report 2002/114, 2002.
28. E. R. Verheul, "Self-Blindable Credential Certificates from the Weil pairing", ASIACRYPT 2001, LNCS 2248, pp.533-551, Springer-Verlag, 2001.