Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computational and Information Science

CIS 2006: Computational Intelligence and Security pp 396–405Cite as

Efficient Implementation of Tate Pairing on a Mobile Phone Using Java

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4456))

Abstract

Pairing-based cryptosystems (PBC) have been attracted by researchers in cryptography. Some implementations show that PBC are relatively slower than the standard public key cryptosystems. We present an efficient implementation for computing Tate pairing on a mobile phone using Java. We implemented the η T pairing (a recent efficient variation of Duursma-Lee algorithm) over some finite fields of characteristic 3 with extension degree m = { 97, 167, 193, 239 }. Our optimized implementation for m = 97 achieved about 0.5 seconds for computing the η T pairing over FOMA SH901iS, NTT DoCoMo. Then our implementation of the η T pairing is compared in the same platform with other Java program of the standard cryptosystems, i.e., RSA cryptosystem and elliptic curve cryptosystem (ECC). The computation speed of the η T pairing is comparable to that of RSA or ECC on the same mobile device.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barreto, P. S. L. M.: A note on efficient computation of cube roots in characteristic 3, IACR ePrint Archive, Report 2004/305 (2004)

    Google Scholar 

  2. Barreto, P. S. L. M., Galbraith, S., O’hEigeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties, To appear in Designs, Codes, and Cryptography

    Google Scholar 

  3. Barreto, P.S.L.M., Kim, H., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) Advances in Cryptology - CRYPTO 2002. LNCS, vol. 2442, pp. 354–368. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Bouncy Castle Crypto APIs, The Legion of the Bouncy Castle. http://www.bouncycastle.org/

  5. Bertoni, G., Guajardo, J., Kumar, S., Orland, G., Paar, C., Wollinger, T.: Efficient GF(p m) arithmetic architectures for cryptographic application. In: Joye, M. (ed.) Topics in Cryptology - CT-RSA 2003. LNCS, vol. 2612, pp. 158–175. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Boneh, D., Franklin, M.: Identity based encryption from the Weil pairing. SIAM J. Comput. 32(3), 586–615 (2001)

    Article  MathSciNet  Google Scholar 

  7. Boneh, D., Gentry, C., Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: Shoup, V. (ed.) Advances in Cryptology – CRYPTO 2005. LNCS, vol. 3621, pp. 258–275. Springer, Heidelberg (2005)

    Google Scholar 

  8. Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) Advances in Cryptology - ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  9. Certicom Research: EC 2: Recommended Elliptic Curve Domain Parameters, Version 1.0 (2000)

    Google Scholar 

  10. Duursma, I., Lee, H.: Tate pairing implementation for hyperelliptic curves y 2 = x p − x + d. In: Laih, C.-S. (ed.) Advances in Cryptology - ASIACRYPT 2003. LNCS, vol. 2894, pp. 111–123. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Hankerson, D., Menezes, A., Vanstone, S.: Guide to elliptic curve cryptography. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  12. Harrison, K., Page, D., Smart, N.: Software implementation of finite fields of characteristic three, for use in pairing-based cryptosystems. LMS J. Comput. Math. 5, 181–193 (2002)

    MathSciNet  MATH  Google Scholar 

  13. IAIK Provider for the Java Cryptography Extension (IAIK-JCE). http://www.iaik.tugraz.at/

  14. Java 2 Platform, Micro Edition (J2ME). http://java.sun.com/javame/

  15. Java Cryptography Extension (JCE). http://java.sun.com/products/jce/

  16. Kerins, T., Marnane, W., Popovici, E., Barreto, P.S.L.M.: Efficient hardware for the Tate pairing calculation in characteristic three. In: Rao, J.R., Sunar, B. (eds.) Cryptographic Hardware and Embedded Systems – CHES 2005. LNCS, vol. 3659, pp. 412–426. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  17. Kwon. S.: Efficient Tate pairing computation for supersingular elliptic curves over binary fields, IACR ePrint Archive, Report, p. 303 (2004)

    Google Scholar 

  18. Scott, M., Costigan, N., Abdulwahab, W.: Implementing Cryptographic Pairings on Smartcards. In: Goubin, L., Matsui, M. (eds.) Cryptographic Hardware and Embedded Systems - CHES 2006. LNCS, vol. 4249, pp. 134–147. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  19. Silverman, J.: The arithmetic of elliptic curves. Springer, Heidelberg (1986)

    MATH  Google Scholar 

  20. Takagi, T., Reis Jr., D., Yen, S.-M., Wu, B.-C.: Radix-r non-adjacent form and its application to pairing-based cryptosystem. IEICE Transactions E89-A(1), 115–123 (2006)

    Article  Google Scholar 

  21. Tillich, S., Großschadl, J.: A survey of public-key cryptography on J2ME-enabled mobile devices. In: Aykanat, C., Dayar, T., Körpeoğlu, İ. (eds.) Computer and Information Sciences - ISCIS 2004. LNCS, vol. 3280, pp. 935–944. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Future University-Hakodate, Japan

    Yuto Kawahara & Tsuyoshi Takagi

  2. University of Tsukuba, Japan

    Eiji Okamoto

Authors
  1. Yuto Kawahara
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tsuyoshi Takagi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eiji Okamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and Technology , Xidian University, 710071, Xi’an, China

    Yuping Wang

  2. Department of Computer Science , Hong Kong Baptist University, Hong Kong, China

    Yiu-ming Cheung

  3. Faculty of Applied Mathematics , Guangdong University of Technology, 5100006, Guangzhou, China

    Hailin Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kawahara, Y., Takagi, T., Okamoto, E. (2007). Efficient Implementation of Tate Pairing on a Mobile Phone Using Java. In: Wang, Y., Cheung, Ym., Liu, H. (eds) Computational Intelligence and Security. CIS 2006. Lecture Notes in Computer Science(), vol 4456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74377-4_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74377-4_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74376-7

  • Online ISBN: 978-3-540-74377-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation