Abstract
The differential power analysis (DPA) is a powerful attack against the implementation of cryptographic schemes on mobile devices. This paper proposes an alternative DPA using the addresses of registers of elliptic curve based cryptosystems (ECC) implemented on smart cards. We call the analysis the address-bit DPA in this paper. The analysis was originally investigated by Messerges, Dabbish and Sloan, however it was thought to be of no effect if the intermediate data are randomized. We extend the analysis and show how the extended analysis works against scalar exponentiations even if the implementation is resistant against the data-based DPA. We show experimental results of our analysis of cryptographic schemes OK-ECDH and OK-ECDSA, which are candidates of the CRYPTREC project in Japan, and evidence of their weakness.
Chapter PDF
Similar content being viewed by others
Keywords
References
M. Akkar, R. Bevan, P. Dischamp, and D. Moyart, “Power Analysis, What is Now Possible...”, Asiacrypt 2000, LNCS 1976, pp. 489–502, Springer-Verlag, 2000.
E. Brier, and M. Joye, “Weierstraβ Elliptic Curves and Side-Channel Attacks”, PKC 2002, LNCS 2274, pp. 335–345, Springer-Verlag, 2002.
I. Blake, G. Seroussi, and N. Smart, Elliptic Curves in Cryptography, Cambridge University Press, 1999.
J. Coron, “Resistance against differential power analysis for elliptic curve cryptosystem”, CHES’99, LNCS 1717, pp. 292–302, Springer-Verlag, 1999.
C. Clavier, and M. Joye, “Universal exponentiation algorithm-A first step towards provable SPA-resistance-”, CHES2001, LNCS 2162, pp. 300–308, Springer-Verlag, 2001.
W. Fischer, C. Giraud, E. Knudsen, and J.P. Seifert, “Parallel Scalar Multiplication on General Elliptic Curves over Fp Hedged Against Non-Differential Side-Channel Attacks”, Cryptology ePrint Archiver, 2002/007, IACR. Available from http://www.iacr.org/
IEEE P1363, Standard Specifications for Public-Key Cryptography, 2000.
T. Izu, and T. Takagi, “A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks”, PKC 2002, LNCS 2274, pp. 280–296, Springer-Verlag, 2002.
M. Joye, and C. Tymen, “Protections against differential analysis for elliptic curve cryptography”, CHES2001, LNCS 2162, pp. 377–390, Springer-Verlag, 2001.
C. Kocher, “Timing attacks on Implementations of Diffie-Hellman, RSA, DSS, and other systems”, Crypto’96, LNCS 1109, pp. 104–113, Springer-Verlag, 1996.
C. Kocher, J. Jaffe, and B. Jun, “Differential power analysis”, Crypto’99, LNCS 1666, pp. 388–397, Springer-Verlag, 1999.
T.S. Messerges, E.A. Dabbish, and R.H. Sloan, “Power Analysis Attacks of Modular Exponentiation in Smartcards”, CHES’99, LNCS 1717, pp. 144–157, Springer-Verlag, 1999.
T.S. Messerges, E.A. Dabbish, and R.H. Sloan, “Investigations of Power Analysis Attacks on Smartcards,” preprint, USENIX Workshop on Smartcard Technology, 1999.
P. Montgomery, “Speeding the Pollard and elliptic curve methods for factorizations”, Mathematics of Computation, vol.48, pp. 243–264, 1987.
National Institute of Standards and Technology, Recommended Elliptic Curves for Federal Government Use, in the appendix of FIPS 186-2.
K. Okeya, H. Kurumatani, and K. Sakurai, “Elliptic curves with the Montgomery form and their cryptographic applications”, PKC 2000, LNCS 1751, pp. 446–465, Springer-Verlag, 2000.
K. Okeya, K. Miyazaki, and K. Sakurai, “A fast scalar multiplication method with randomized projective coordinates on a Montgomery-form elliptic curve secure against side channel attacks”, ICISC 2001, LNCS 2288, pp. 428–439, Springer-Verlag, 2001.
K. Okeya, and K. Sakurai, “Power analysis breaks elliptic curve cryptosystem even secure against the timing attack”, Indocrypt 2000, LNCS 1977, pp. 178–190, Springer-Verlag, 2000.
K. Okeya, and K. Sakurai, “Efficient elliptic curve cryptosystem from a scalar multiplication algorithm with recovery of the y-coordinate on a Montgomery-form elliptic curve”, CHES 2001, LNCS 2162, pp. 126–141, Springer-Verlag, 2001.
Standards for Efficient Cryptography Group (SECG), Specification of Standards for Efficient Cryptography.
J. Yajima, K. Itoh, M. Takenaka, and N. Torii, “DPA countermeasure by improving the window method”, to appear in the proceeding of CHES 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Itoh, K., Izu, T., Takenaka, M. (2003). Address-Bit Differential Power Analysis of Cryptographic Schemes OK-ECDH and OK-ECDSA. In: Kaliski, B.S., Koç, ç.K., Paar, C. (eds) Cryptographic Hardware and Embedded Systems - CHES 2002. CHES 2002. Lecture Notes in Computer Science, vol 2523. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36400-5_11
Download citation
DOI: https://doi.org/10.1007/3-540-36400-5_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00409-7
Online ISBN: 978-3-540-36400-9
eBook Packages: Springer Book Archive