Efficient algorithms for Tate pairing

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E89-A, Issue 1, 2006, Pages 134-143

  Kobayashi, Tetsutaro ^a,b   Aoki, Kazumaro ^b   Imai, Hideki ^a,c  

^a INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

^b NTT CORPORATION   (Japan)

^c Institute of Industrial Science   (Japan)

Author keywords

Elliptic curve cryptosystem; Fast computation; Tate pairing; Weil pairing

Indexed keywords

COMPUTATION THEORY; COMPUTER SCIENCE; CRYPTOGRAPHY; ELECTRONICS ENGINEERING; INFORMATION THEORY; NETWORK PROTOCOLS;

ELLIPTIC CURVE CRYPTOSYSTEMS; FAST COMPUTATION; TATE PAIRING; WEIL PAIRING;

ALGORITHMS;

EID: 32244443498     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e89-a.1.134     Document Type: Article

References (17)

1. R. Sakai, K. Ohgishi, and M. Kasahara, "Cryptosystems based on pairing," 2000 Symposium on Cryptography and Information Security, SCIS'00, no. C20, 2000.
2. D. Boneh and M. Franklin, "Identity based encryption from the Weil pairing," Advances in Cryptology - CRYPTO'01, LNCS 2139, pp.213-229, Springer-Verlag, 2001.
3. D. Boneh, B. Lynn, and H. Shacham, "Short signatures from the Weil pairing," Advances in Cryptology - ASIACRYPT'01, LNCS 2248, pp.514-532, Springer-Verlag, 2001.
4. V. Miller, "Short programs for functions on curves," Unpublished manuscript, 1986. available at http://crypto.stanford.edu/miller/ miller.pdf
5. T. Izu and T. Takagi, "Efficient computations of the Tate pairing for the large MOV degrees," ICISC'02, LNCS 2587, pp.283-297, Springer-Verlag, 2003.
6. H. Cohen, A. Miyaji, and T. Ono, "Efficient elliptic curve exponentiation using mixed coordinates," Advances in Cryptology -ASIACRYPT'98, ed. K. Ohta and D. Pei, LNCS 1514, pp.51-65, Springer-Verlag, Berlin, Heidelberg, New York, 1998.
7. Y. Sakai and K. Sakurai, "Efficient scalar multiplications on elliptic curves with direct computations of several doublings," IEICE Trans. Fundamentals, vol.E84-A, no.1, pp.120-129, Jan. 2001.
8. A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of applied cryptography, CRC Press, 1997.
9. H. Cohen, "Analysis of the sliding window powering algorithm," J. Cryptol., vol.18, no.1, pp.63-76, 2005.
10. A. Menezes, Elliptic Curve Public Key Cryptosystem, Kluwer Academic Publishers, 1993.
11. J.H. Silverman, The Arithmetic of Elliptic Curves, Springer-Verlag, 1986.
12. A.K. Lenstra and E.R. Verheul, "Selecting cryptographic key sizes," J. Cryptol., vol.14, no.4, pp.255-293, 2001. (The extended abstract was presented at PKC'00).
13. T. Kobayashi and H. Morita, "Fast modular inversion algorithm to match any operation unit," IEICE Trans. Fundamentals, vol.E82-A, no.5, pp.733-740, May 1999.
14. C. Gentry and A. Silverberg, "Hierarchical ID-based cryptography," Advances in Cryptology-ASIACRYPT'02, LNCS 2501, pp.548-566, Springer-Verlag, 2002.
15. D. Boneh and X. Boyen, "Secure identity based encryption without random oracles," Advances in Cryptology - CRYPTO'04, LNCS 3152, pp.443-459, Springer-Verlag, 2004.
16. A. Miyaji, M. Nakabayashi, and S. Takano, "New explicit conditions of elliptic curve traces for FR-reduction," IEICE Trans. Fundamentals, vol.E84-A, no.5, pp.1234-1243, May 2001.
17. P.S.L.M. Barreto, B. Lynn, and M. Scott, "Constructing elliptic curves with prescribed embedding degrees," Security in Communication Networks-SCN'2002, LNCS 2576, pp.263-273, 2002.