Efficient implementation of tate pairing on a mobile phone using Java

2006 International Conference on Computational Intelligence and Security, ICCIAS 2006

Volumn 2, Issue , 2006, Pages 1247-1252

  Kawahara, Yuto ^a   Takagi, Tsuyoshi ^a   Okamoto, Eiji ^b  

^a FUTURE UNIVERSITY HAKODATE   (Japan)

^b UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

Efficient implementation; Java; Mobile phone; Tate pairing

Indexed keywords

COMPUTATION THEORY; JAVA PROGRAMMING LANGUAGE; MOBILE DEVICES; MOBILE PHONES;

ELLIPTIC CURVE CRYPTOSYSTEM (ECC); PAIRING-BASED CRYPTOSYSTEMS (PBC); TATE PAIRING;

PUBLIC KEY CRYPTOGRAPHY;

EID: 38949204473     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCIAS.2006.295256     Document Type: Conference Paper

References (20)

1. Institute for applied information processing and communication, sifting secure information and communication technologies. http://www.iaik.tugraz.at/.
2. Java 2 Platform, Micro Edition (J2ME). http://java.sun.com/javame/.
3. Java Cryptography Extension (JCE). http://java.sun.com/products/jce/.
4. The legion of the bouncy castle, bouncy castle crypto apis. http://www.bouncycastle.org/.
5. P. Barreto, S. Galbraith. and C. O'hEigeartaigh. Efficient pairing computation on supersingular abelian varieties, 2005. To appear in Designs, Codes, and Cryptography.
6. P. Barreto, H. Kim, B. Lynn, and M. Scott. Efficient algorithms for pairing-based ciyptosystems. In CRYPTO 2002, volume 2442 of LNCS, pages 354-368. 2002.
7. P. S. L. M. Barreto. A note on efficient computation of cube roots in characteristic 3. Cryptology ePrint Archive, Report 2004/305, 2004.
8. m) arithmetic architectures for cryptographic application. In CT-RSA 2003. volume 2612 of LNCS, pages 158-175, 2003.
9. D. Boneh and M. Franklin. Identity based encryption from the Weil pairing. SIAM J. Comput., 32(3):586-615, 2001.
10. D. Boneh, C. Gentry, and B. Waters. Collusion resistant broadcast encryption with short ciphertexts and private keys. In CRYPTO 2005, volume 3621 of LNCS, pages 258-275. 2005.
11. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. In ASIACRYPTO 2001, volume 2248 of LNCS, pages 514-532, 2001.
12. p - x + d. In ASIACRYPTO 2003, volume 2894 of LNCS, pages 111-123, 2003.
13. D. Hankerson, A. Menezes, and S. Vanstone. Guide to elliptic curve cryptography. Springer-Verlag, 2004.
14. K. Harrison, D. Page, and N. Smart. Software implementation of finite fields of characteristic three, for use in pairingbased cryptosystems. LMS J. Comput. Math.. 5:181-193, 2002.
15. T. Kerins. W. Marnane, E. Popovici, and P. Barreto. Efficient hardware for the Tate pairing calculation in characteristic three. In CHES 2005, volume 3659 of LNCS, pages 412-426, 2005.
16. S. Kwon. Efficient Tate pairing computation for supersingular elliptic curves over binary fields. Cryptology ePrint Archive, Report 2004/303, 2004.
17. C. Research. Sec 2: Recommended elliptic curve domain parameters, 2000.
18. M. Scott, N. Costigan, and W. Abdulwahab. Implementing cryptographic pairings on smartcards. Cryptology ePrint Archive, Report 2006/144, 2006.
19. T. Takagi, J. D. Reis, S.-M. Yen, and B.-C. Wu. Radix-r non-adjacent form and its application to pairing-based cryptosystem. IEICE Transactions, E89-A(1):l 15-123, 2006.
20. S. Tillich and J. G. schadl. A survey of public-key cryptography on J2ME-enabled mobile devices. In ISCIS 2004, volume 3280 of LNCS, pages 935-944, 2004.