Abstract
The Simple Power Analysis (SPA) attack against an elliptic curve cryptosystem distinguishes between point doubling and point addition in a single execution of scalar multiplication. Although many SPA-resistant scalar multiplication algorithms have been proposed, few countermeasures for multi-scalar multiplications are known. In this paper, we propose a new SPA-resistant multi-scalar multiplication for a pair of integers combing the Joint Sparse Form (JSF) representation technique for pair of integers, point randomization, and uniform operation sequence. The new method requires about 8.5% less multiplications in the field compared to the known countermeasures.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Becker, A.: Methods of Fault Analysis Attacks on Elliptic Curve Cryptosystems. Comparison and Combination of Countermeasures to resist SCA. Diploma Thesis of Darmstadt University of Technology (September 2006), http://www.cdc.informatik.tu-darmstadt.de/reports/reports/Anja_Becker.diplom.pdf
Chen, T.-S., Huang, K.-H., Chung, Y.-F.: Digital Multi-Signature Scheme Based on the Elliptic Curve Cryptosystem. Journal of Computer Science and Technology 19(4), 570–573 (2004)
Ciet, M., Joye, M. (Virtually) free randomization techniques for elliptic curve cryptography. In: Qing, S., Gollmann, D., Zhou, J. (eds.) ICICS 2003. LNCS, vol. 2836, pp. 348–359. Springer, Heidelberg (2003)
Clavier, C., Joye, M.: Universal exponentiation algorithm. In: Koç, Ç.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 300–308. Springer, Heidelberg (2001)
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)
Hasan, M.: Power analysis attacks and algorithmic approaches to their countermeasures for Koblitz curve cryptosystems. IEEE Transactions on Computer 50(10), 1071–1083 (2001)
Hitchcock, Y., Montague, P.: A new elliptic curve scalar multiplication algorithm to resist simple power analysis. In: Batten, L.M., Seberry, J. (eds.) ACISP 2002. LNCS, vol. 2384, pp. 214–225. Springer, Heidelberg (2002)
IEEE P1363/D9 Standard specifications for public-key cryptography, New York, USA, Institute of Electrical and Electronics Engineers, Inc. (2001)
Koblitz, N.: Elliptic curve cryptosystems. Mathematics of computation 48(177), 203–209 (1987)
Kocher, P.C.: Timing attacks on implementations of diffie-hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104–113. Springer, Heidelberg (1996)
Kocher, P.C., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 388–397. Springer, Heidelberg (1999)
Lee, M.-K.: SPA-resistant simultaneous scalar multiplication. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3481, pp. 314–321. Springer, Heidelberg (2005)
Lim, C.H., Lee, P.J.: More flexible exponentiation with precomputation. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 95–107. Springer, Heidelberg (1994)
Lim, C.H., Hwang, H.S.: Fast implementation of elliptic curve arithmetic in GF(pm). In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 405–421. Springer, Heidelberg (2000)
Miller, V.: Uses of elliptic curve in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417–426. Springer, Heidelberg (1986)
Moller, B.: Securing elliptic curve point multiplication against side-channel attacks. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol. 2200, pp. 324–334. Springer, Heidelberg (2001)
Oswald, E., Aigner, M.: Randomized addition-subtraction chains as a countermeasure against power attacks. In: Koç, Ç.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 39–50. Springer, Heidelberg (2001)
Solinas, J.: Low-Weight binary Representations for pairs of integers. Technical Report CORR 2001-41 Centre for Applied Cryptographic Research, www.cacr.math.uwaterloo.ca/techreports/2001/corr2001-41.ps
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, D., Tan, Z., Dai, Y. (2009). New Elliptic Curve Multi-scalar Multiplication Algorithm for a Pair of Integers to Resist SPA. In: Yung, M., Liu, P., Lin, D. (eds) Information Security and Cryptology. Inscrypt 2008. Lecture Notes in Computer Science, vol 5487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01440-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-01440-6_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01439-0
Online ISBN: 978-3-642-01440-6
eBook Packages: Computer ScienceComputer Science (R0)