Towards Sound Approaches to Counteract Power-Analysis Attacks

  • Suresh Chari
  • Charanjit S. Jutla
  • Josyula R. Rao
  • Pankaj Rohatgi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1666)

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.

References

  1. 1.
    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.CrossRefGoogle Scholar
  2. 2.
    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.
  3. 3.
    D. Chaum. Blind Signatures for Untraceable Payments. Advances in Cryptology: Proceedings of Crypto’ 82, Plenum Press, 1983, pp 199–203.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    W. Feller. An introduction to Probability Theory and its application, Vol. 1, Wiley Mathematical Statistics Series, 1950.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    M. Luby. Pseudorandomness and cryptographic applications. Princeton University Press.Google Scholar
  8. 9.
    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.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Suresh Chari
    • 1
  • Charanjit S. Jutla
    • 1
  • Josyula R. Rao
    • 1
  • Pankaj Rohatgi
    • 1
  1. 1.I.B.M. Thomas J. Watson Research CenterYorktown HeightsUSA

Personalised recommendations