Efficient tate pairing computation for elliptic curves over binary fields

Lecture Notes in Computer Science

Volumn 3574, Issue , 2005, Pages 134-145

  Kwon, Soonhak ^a  

^a Sungkyunkwan University   (South Korea)

Author keywords

Automorphism; Divisor; Roots of unity; Supersingular elliptic curve; Tate pairing

Indexed keywords

SECURITY OF DATA;

AUTOMORPHISM; DIVISOR; ROOTS OF UNITY; SUPERSINGULAR ELLIPTIC CURVE; TATE PAIRING;

COMPUTATIONAL GEOMETRY;

EID: 26444543201     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11506157_12     Document Type: Conference Paper

References (30)

1. A.J. Menezes, T. Okamoto, and S.A. Vanstone, "Reducing elliptic curve logarithms to logarithms in a finite field," IEEE Trans. Information Theory, vol. 39, pp. 1639-1646, 1993.
2. G. Frey and H. Rück, "A remark concerning m-divisibility and the discrete logarithm in the divisor class groups of curves," Math. Comp., vol. 62, pp. 865-874, 1994.
3. D. Boneh and M. Franklin, "Identity based encryption from the Weil pairing," Crypto 2001, Lecture Notes in Computer Science, vol. 2139, pp. 213-229, 2001.
4. D. Boneh, B. Lynn, and H. Shacham, "Short signatures from the Weil pairing," Asiacrypt 2001, Lecture Notes in Computer Science, vol. 2248, pp. 514-532, 2002.
5. A. Joux, "A one round protocol for tripartite Diffie-Hellman," ANTS 2000, Lecture Notes in Computer Science, vol. 1838, pp. 385-394, 2000.
6. R. Sakai, K. Ohgishi, and M. Kasahara, "Cryptosystems based on pairing," SICS 2000, Symposium on Cryptography and Information Security, pp. 26-28, 2000.
7. N.P. Smart, "An identity based authentication key agreement protocol based on pairing," Electronics Letters, vol. 38, pp. 630-632, 2002.
8. R. Granger, D. Page, and M. Stam, "Hardware and software normal basis arithmetic for pairing based cryptography in characteristic three," preprint, available at http://eprint.iacr.org/2004/157.pdf, 2004.
9. R. Granger, D. Page, and M. Stam, "On small characteristic algebraic tori in pairing based cryptography," preprint available at http://eprint.iacr.org/2004/132.pdf, 2004.
10. p - x + d," Asiacrypt 2003, Lecture Notes in Computer Science, vol. 2894, pp. 111-123, 2003.
11. K. Eisenträger, K. Lauter, and P.L. Montgomery, "Improved Weil and Tate pairing for elliptic and hyperelliptic curves," preprint, 2004.
12. A. Miyaji, M. Nakabayashi, and S. Takano, "New explicit conditions of elliptic curve trace for FR-reduction," IEICE Trans. Fundamentals, vol. E84 A, pp. 1-10, 2001.
13. J.H. Silverman, The Arithmetic of Elliptic Curves, Springer-Verlag, 1985.
14. P. Barreto, H. Kim, B. Lynn, and M. Scott, "Efficient algorithms for pairing based cryptosystems," Crypto 2002, Lecture Notes in Computer Science, vol. 2442, pp. 354-368, 2002.
15. F. Hess, "A Note on the Tate pairing of curves over finite fields," Arch. Math. vol. 82, pp. 28-32, 2004.
16. F. Hess, "Efficient identity based signature schemes based on pairings," SAC 2002, Lecture Notes in Computer Science, vol. 2595, 310-324, 2003.
17. A.J. Menezes, Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publisher, 1993.
18. K. Harrison, Personal Communications, 2004.
19. J.C. Cha and J.H. Cheon, "An identity-based signature from gap Diffie-Hellman groups," PKC 2003, Lecture Notes in Computer Science, vol. 2567, 18-30, 2003.
20. K. Rubin and A. Silverberg "Torus based cryptography," Crypto 2003, Lecture Notes in Computer Science, vol. 2729, pp. 349-365, 2003.
21. S. Galbraith, K. Harrison, and D. Soldera, "Implementing the Tate pairing," ANTS 2002, Lecture Notes in Computer Science, vol. 2369, pp. 324-337, 2002.
22. V. Miller, "Short programs for functions on curves," unpublished manuscript, 1986.
23. D. Hankerson, J.L. Hernandez, and A.J. Menezes, "Software implementation of elliptic curve cryptography over binary fields," CHES 2000, Lecture Notes in Computer Science, vol. 1965, pp. 1-24, 2000.
24. S. Galbraith, "Supersingular curves in cryptography," Asiacrypt 2001, Lecture Notes in Computer Science, vol. 2248, pp. 495-513, 2001.
25. E.R. Verheul, "Evidence that XTR is more secure than supersingular elliptic curve cryptosystems," Eurocrypt 2001, Lecture Notes in Computer Science, vol. 2045, pp. 195-210, 2001.
26. K. Fong, D. Hankerson, J. López, and A. Menezes, "Field inversion and point halving revisited," Technical Report CORR 2003-18, Univ. of Waterloo, 2003.
27. S. Gao, J. von zur Gathen, and D. Panario, "Gauss periods and fast exponentiation in finite fields," Latin 1995, Lecture Notes in Computer Science, vol. 911, pp. 311-322, 1995.
28. J. Baek and Y. Zheng, "Identity-based threshold signature scheme from the bilinear pairings," ITCC 2004, Proceedings of International Conference on Information Technology, vol 1, pp. 124-128, 2004.
29. P. Gaudry, F. Hess, and N.P. Smart, "Constructive and destructive facets of Weil descent on elliptic curves," J. of Cryptology, vol. 15, pp. 19-46, 2002.
30. N. Koblitz, A. Menezes, and S. Vanstone, "The state of elliptic curve cryptography," Design, Codes and Cryptography, vol. 19, pp. 173-193, 2000.