Abstract
Several known invasive and non-invasive attacks against pairing algorithms only work if the second but not if the first argument of the pairing is the secret. In this paper we extend some of these attacks to the case where the first argument is the secret. Hence we conclude that positioning the secret as the first argument of the pairing does not necessarily improve the security against (SCAs), as it sometimes has been suggested.
This work was funded by the German Ministry of Education and Research, grant 01IS10030C.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Acar, T., Lauter, K., Naehrig, M., Shumow, D.: Affine Pairings on ARM. IACR Cryptology ePrint Archive 2011, 243 (2011)
Barreto, P.S.L.M., Lynn, B., Scott, M.: On the Selection of Pairing-Friendly Groups. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 17–25. Springer, Heidelberg (2004)
Blake, I.F., Seroussi, G., Smart, N.P. (eds.): Advances in Elliptic Curve Cryptography. London Mathematical Society Lecture Note Series, vol. 317. Cambridge University Press (2005)
Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. SIAM Journal on Computing 32(3), 586–615 (2003)
Hess, F., Smart, N.P., Vercauteren, F.: The Eta Pairing Revisited. IEEE Transactions on Information Theory 52(10), 4595–4602 (2006)
Joye, M., Neven, G. (eds.): Identity-Based Cryptography. In: Cryptology and Information Security, vol. 2. IOS Press (2009)
Joye, M., Tunstall, M. (eds.): Fault Attacks in Cryptography. Information Security and Cryptography. Springer (2012)
Kim, T., Takagi, T., Han, D.G., Kim, H., Lim, J.: Side Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields. In: Pointcheval, D., Mu, Y., Chen, K. (eds.) CANS 2006. LNCS, vol. 4301, pp. 168–181. Springer, Heidelberg (2006)
Miller, V.S.: The Weil Pairing, and Its Efficient Calculation. Journal of Cryptology 17(4), 235–261 (2004)
El Mrabet, N.: What about Vulnerability to a Fault Attack of the Miller’s Algorithm During an Identity Based Protocol? In: Park, J.H., Chen, H.-H., Atiquzzaman, M., Lee, C., Kim, T.-h., Yeo, S.-S. (eds.) ISA 2009. LNCS, vol. 5576, pp. 122–134. Springer, Heidelberg (2009)
Mrabet, N.E., Flottes, M.L., Natale, G.D.: A practical Differential Power Analysis attack against the Miller algorithm. In: Research in Microelectronics and Electronics, pp. 308–311 (2009)
Page, D., Vercauteren, F.: Fault and Side-Channel Attacks on Pairing Based Cryptography. IACR Cryptology ePrint Archive 2004, 283 (2004)
Page, D., Vercauteren, F.: A Fault Attack on Pairing-Based Cryptography. IEEE Transactions on Computers 55(9), 1075–1080 (2006)
Barreto, P.S.L.M., Galbraith, S.D., Héigeartaigh, C.Ó.: Efficient Pairing Computation on Supersingular Abelian Varieties. Designes, Codes and Cryptography 42(3), 239–271 (2007)
Rosen, K.H. (ed.): Handbook of Elliptic and Hyperelliptic Curve Cryptography. Discrete Mathematics and its Applications. Chapman & Hall/CRC (2006)
Scott, M.: Computing the Tate Pairing. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 293–304. Springer, Heidelberg (2005)
Scott, M., Costigan, N., Abdulwahab, W.: Implementing Cryptographic Pairings on Smartcards. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol. 4249, pp. 134–147. Springer, Heidelberg (2006)
Shoup, V.: A computational introduction to number theory and algebra. Cambridge University Press (2006)
Silverman, J.H.: The Arithmetic of Elliptic Curves, 2nd edn. Graduate Texts in Mathematics, vol. 106. Springer (2009)
Galbraith, S.D., Héigeartaigh, C.Ó., Sheedy, C.: Simplified Pairing Computation and Security Implications. Journal of Mathematical Cryptology 1(3), 267–281 (2007)
Whelan, C., Scott, M.: Side Channel Analysis of Practical Pairing Implementations: Which Path is More Secure? In: Nguyên, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol. 4341, pp. 99–114. Springer, Heidelberg (2006)
Whelan, C., Scott, M.: The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 225–246. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blömer, J., Günther, P., Liske, G. (2013). Improved Side Channel Attacks on Pairing Based Cryptography. In: Prouff, E. (eds) Constructive Side-Channel Analysis and Secure Design. COSADE 2013. Lecture Notes in Computer Science, vol 7864. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40026-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-40026-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40025-4
Online ISBN: 978-3-642-40026-1
eBook Packages: Computer ScienceComputer Science (R0)