Side Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields | SpringerLink
Skip to main content
Springer Nature Link
Log in

Side Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields

  • Conference paper
Cryptology and Network Security (CANS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 4301))

Included in the following conference series:

Abstract

Pairings on elliptic curves have been used as cryptographic primitives for the development of new applications such as identity based schemes. For the practical applications, it is crucial to provide efficient and secure implementations of the pairings. There have been several works on efficient implementations of the pairings. However, the research for secure implementations of the pairings has not been thoroughly investigated. In this paper, we investigate vulnerability of the pairing used in some pairing based protocols against side channel attacks. We propose an efficient algorithm secure against such side channel attacks of the eta pairing using randomized projective coordinate systems for the pairing computation.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Barreto, P.S.L.M., Galbraith, S., OhEigeartaigh, C., Scott, M.: Efficient Pairing Computation on Supersingular Abelian Varieties. Designs, Codes and Cryptography (preprint, 2005) (to appear)

    Google Scholar 

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

    Chapter  Google Scholar 

  3. Barreto, P.S.L.M., Lynn, B., Scott, M.: Efficient implementation of pairing based cryptosystems. Journal of Cryptology 17(4), 321–334 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bertoni, G., Breveglieri, L., Fragneto, P., Pelosi, G.: Parallel Hardware Architectures for the Cryptographic Tate Pairing. In: Proceedings of the Third International Conference on Information Technology: New Generations (ITNG 2006), pp. 186–191 (2006)

    Google Scholar 

  5. Bertoni, G.M., Chen, L., Fragneto, P., Harrison, K.A., Pelosi, G.: Computing tate pairing on smartcards (2005), http://www.st.com/stonline/products/families/smartcard/ches2005_v4.pdf

  6. Boneh, D., Franklin, M.: Identity Based Encryption from the Weil Pairing. SIAM J. of Computing 32(3), 586–615 (2003)

    Article  MATH  MathSciNet  Google Scholar 

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

    Chapter  Google Scholar 

  8. Cha, J.C., Cheon, J.H.: An Indentity-Based Signature from Gap Diffie-Hellman Groups. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 18–30. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Coron, J.S.: Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems. In: Koç, Ç.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 292–302. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  10. Dutta, R., Barua, R., Sarkar, P.: Pairing-Based Cryptographic Protocols: A Survey. Cryptology ePrint Archive, Report 2004/064 (2006), http://eprint.iacr.org/2004/064

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

    Chapter  Google Scholar 

  12. Fong, K., Hankerson, D., López, J., Menezes, A.: Field inversion and point halving revisited, Technical Report CORR 2003-18, University of Waterloo (August 2002)

    Google Scholar 

  13. Galbraith, S.D., Harrison, K., Soldera, D.: Implementing the Tate pairing. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 324–337. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  14. Gemplus.: ID based Cryptography and Smartcards (2005), http://www.gemplus.com/smart/rd/publications/pdf/Joy05iden.pdf

  15. Granger, R., Page, D., Stam, M.: Hardware and software normal basis arithmetic for pairing based cryptography in characteristic three. IEEE Transactions on Computers 54(7), 852–860 (2005)

    Article  Google Scholar 

  16. Hankerson, D., Hernandez, J.L., Menezes, A.: Software Implementation of Elliptic Curve Cryptography over Binary Fields. In: Paar, C., Koç, Ç.K. (eds.) CHES 2000. LNCS, vol. 1965, pp. 1–24. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  17. Hess, F.: Exponent group signature schemes and efficient identity based signature schems based on pairing. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595, pp. 310–324. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  18. Hess, F., Smart, N., Vercauteren, F.: The eta pairing revisited. Cryptology ePrint Archive, Report 2006/110 (2006), http://eprint.iacr.org/2006/110

  19. Izu, T., Takagi, T.: Efficient Computations of the Tate Pairing for the Large MOV Degrees. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol. 2587, pp. 283–297. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  20. Kocher, C., Jaffe, J., Jun, B.: Differential Power Analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 388–397. Springer, Heidelberg (1999)

    Google Scholar 

  21. Kwon, S.: Efficient Tate Pairing Computation for Elliptic Curves over Binary Fields. In: Boyd, C., González Nieto, J.M. (eds.) ACISP 2005. LNCS, vol. 3574, pp. 134–145. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  22. Menezes, A.: Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, Dordrecht (1993)

    MATH  Google Scholar 

  23. Messerges, T.S.: Using Second-Order Power Analysis to Attack DPA Resistant Software. In: Paar, C., Koç, Ç.K. (eds.) CHES 2000. LNCS, vol. 1965, pp. 238–251. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  24. Page, D., Vercauteren, F.: Fault and Side-Channel Attacks on Pairing Based Cryptography. Cryptology ePrint Archive, Report 2005/283 (2005), http://eprint.iacr.org/2005/283

  25. Page, D., Vercauteren, F.: A Fault Attack on Pairing Based Cryptography. IEEE Transactions on Computers (to appear, 2006)

    Google Scholar 

  26. Paterson, K.G.: ID-based signature from pairings on elliptic curves. Electronics Letters 38(18), 1025–1026 (2002)

    Article  Google Scholar 

  27. Ronan, R., OhEigeartaigh, C., Murphy, C., Scott, M., Kerins, T., Marnane, W.: An Embedded Processor for a Pairing-Based Cryptosystem. In: Proceedings of the Third International Conference on Information Technology: New Generations (ITNG 2006), pp. 192–197 (2006)

    Google Scholar 

  28. Sakai, R., Kasahara, M.: ID based cryptosystems with pairing on elliptic curve. Cryptography ePrint Archive, Report 2003/054 (2003), http://eprint.iacr.org/2003/054

  29. Scott, M.: Computing the Tate Pairing. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 293–304. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  30. Scott, M., Costigan, N., Abdulwahab, W.: Implemetation Cryptographic Pairings on Smartcards. Cryptography ePrint Archive, Report 2006/144 (2006), http://eprint.iacr.org/2006/144

  31. Smart, N.P.: An identity based authentication key agreement protocol based on pairing. Electronics Letters 38(13), 630–632 (2002)

    Article  MATH  Google Scholar 

  32. Verheul, E.: Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. Journal of Cryptology 17(4), 277–296 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  33. Whelan, C., Scott, M.: Side Channel Analysis of Practical Pairing Implementations: Which Path is More Secure? Cryptography ePrint Archive, Report 2006/237 (2006), http://eprint.iacr.org/2006/237

Download references

Author information

Authors and Affiliations

  1. Center for Information and Security Technologies(CIST), Korea University, Seoul, Korea

    Tae Hyun Kim & Jongin Lim

  2. FUTURE UNIVERSITY-HAKODATE, Japan

    Tsuyoshi Takagi

  3. Electronics and Telecommunications Research Institute(ETRI), Korea

    Dong-Guk Han & Ho Won Kim

Authors
  1. Tae Hyun Kim
    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. Dong-Guk Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ho Won Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jongin Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Ecole Normale Supérieure – LIENS/CNRS/INRIA,, France

    David Pointcheval

  2. Centre for Computer and Information Security Research School of Computer Science and Software Engineering, University of Wollongong, Australia

    Yi Mu

  3. Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200240, Shanghai, China

    Kefei Chen

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, T.H., Takagi, T., Han, DG., Kim, H.W., Lim, J. (2006). Side Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields. In: Pointcheval, D., Mu, Y., Chen, K. (eds) Cryptology and Network Security. CANS 2006. Lecture Notes in Computer Science, vol 4301. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11935070_11

Download citation

  • DOI: https://doi.org/10.1007/11935070_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49462-1

  • Online ISBN: 978-3-540-49463-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics