Abstract
With the popularity of wireless communication devices a growing new important dimension of embedded systems design is that of security. This paper presents exploration of power attack resistance, using a statistical approach for identifying regions of the power trace which pose a possible security threat. Unlike previous power analysis research, a new metric supporting small timing shifts and complex processor architectures is presented. This research helps to identify how to create secure implementations of software. Elliptic curve point multiplications using the Weierstrass curve and Jacobi form over 192-bit prime fields were implemented and analyzed. Over 60 real measured power traces of elliptic curve point multiplications running at 100MHz on a DSP VLIW processor core were analyzed. Modification of power traces through software design was performed to maximize resistance to power attacks in addition to improving energy dissipation and performance by 44% with a 31% increase in code size. This research is important for industry since efficient yet secure cryptography is crucial for wireless communication embedded system devices and future IP enabled smart cards.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
P. Kocher, “Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems”, LNCS 1109, 1996.
S. Dusse, B. Kaliski, “A cryptographic library for the Motorola DSP56000”, vol 473, LNCS, May 1990, pp. 230–244.
P. Liardet, N. Smart, “Preventing SPA/DPA in ECC systems using the Jacobi Form”, LNCS 2162, May 2001, pp 391–401.
T. Wollinger, M. Wang, J. Guajardo, C. Paar, “How well areHigh End DSPs Suited for the AES Algorithms?”
IEEE Std 1363-2000, IEEE Standard specifications for public-key cryptography, IEEE computer Soc. 2000.
D. Hankerson, J. Hernandez, A. Menezes, “Software Implementation of NIST Elliptic Curves over Prime Fields”, White Paper, http://www.certicom.com, 2000
Chudnovsky, D.V., G.V. Chudnovsky, “Sequences of Numbers generated by addition in formal groups and new primality and factorization tests”, Applied Mathematics, Vol.7, pp 385–434, 1986.
K. Itoh, M. Takenaka, N. Torii, S. Temma, Y. Kurihara, “Fast implementation of publickey cryptography on a DSP TMS320C6201”, CHES’ 99, vol 1717, LNCS, 1999, pp. 61–72.
M. Joye, J. Quisquater, “Hessian Elliptic Curves and Side-Channel Attacks” LNCS 2162, May 2001, pp 402–410.
P. Kocher, J. Jaffe, B. Jun, “Differential Power Analysis” Crypto’99, LNCS 1666, 1999.
T. Messerges, E. Dabbish, R. Sloan, “Investigations of Power analysis attacks on Smartcards” USENIX workshop on Smartcard Technology, 1999.
O. Kommerling, M. Kuhn, “Design principles for Tamper-resistant Smartcard Processors”, USENIX workshop on Smartcard Technology, 1999.
I. Blake, G. Seroussi, N. Smart, “Elliptic Curves in Cryptography”, LMS 265, Cambridge Univ. Press, 2000
R. Muresan, C. Gebotys, “Current consumption dynamics at instruction and program level for a VLIW DSP Processor”, ACM Proc. of ISSS, Oct 2001, pp. 130–135.
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
Gebotys, C.H., Gebotys, R.J. (2003). Secure Elliptic Curve Implementations: An Analysis of Resistance to Power-Attacks in a DSP Processor. 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_10
Download citation
DOI: https://doi.org/10.1007/3-540-36400-5_10
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