Abstract
Side channel cryptanalysis techniques, such as the analysis of instantaneous power consumption, have been extremely effective in attacking implementations on simple hardware platforms. There are several proposed solutions to resist these attacks, most of which are ad—hoc and can easily be rendered ineffective. A scientific approach is to create a model for the physical characteristics of the device, and then design implementations provably secure in that model, i.e, they resist generic attacks with an a priori bound on the number of experiments. We propose an abstract model which approximates power consumption in most devices and in particular small single—chip devices. Using this, we propose a generic technique to create provably resistant implementations for devices where the power model has reasonable properties, and a source of randomness exists. We prove a lower bound on the number of experiments required to mount statistical attacks on devices whose physical characteristics satisfy reasonable properties.
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 Diffe-Hellman, RSA, DSS and Other Systems. Advances in Cryptology-Crypto’ 96, Lecture Notes in Computer Science # 1109, pp 104–113.
P. Kocher, J. Jaffe and B. Jun. Differential Power Analysis: Leaking Secrets. In Proceedings of Crypto’ 99. A preliminary version is available online at http://www.cryptography.com/dpa/technical/index.html.
D. Chaum. Blind Signatures for Untraceable Payments. Advances in Cryptology: Proceedings of Crypto’ 82, Plenum Press, 1983, pp 199–203.
J. Daemen and V. Rijmen. Resistance against implementation attacks: A comparative study of the AES proposals. Proceedings of the Second AES Candidates Conference, Mar 1999, Rome, Italy.
W. Feller. An introduction to Probability Theory and its application, Vol. 1, Wiley Mathematical Statistics Series, 1950.
M. Naor, O. Reingold. On the construction of pseudo-random permutations: Luby-Rackoff revisited. In Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, pp 189–199.
M. Luby. Pseudorandomness and cryptographic applications. Princeton University Press.
M. Abadi, J. Feigenbaum, and J. Kilian. On Hiding Information from an Oracle. Journal of Computer and System Sciences, 39(1):21–50, Aug. 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chari, S., Jutla, C.S., Rao, J.R., Rohatgi, P. (1999). Towards Sound Approaches to Counteract Power-Analysis Attacks. In: Wiener, M. (eds) Advances in Cryptology — CRYPTO’ 99. CRYPTO 1999. Lecture Notes in Computer Science, vol 1666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48405-1_26
Download citation
DOI: https://doi.org/10.1007/3-540-48405-1_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66347-8
Online ISBN: 978-3-540-48405-9
eBook Packages: Springer Book Archive