Horizontal correlation analysis on exponentiation

  • Authors:
  • Christophe Clavier;Benoit Feix;Georges Gagnerot;Mylène Roussellet;Vincent Verneuil

  • Affiliations:
  • XLIM-CNRS, Université de Limoges, Limoges, France;Inside Contactless, Aix-en-Provence, Cedex 3, France;Inside Contactless, Aix-en-Provence, Cedex 3, France;Inside Contactless, Aix-en-Provence, Cedex 3, France;Inside Contactless, Aix-en-Provence, Cedex 3, France and Institut de Mathématiques de Bordeaux, Talence cedex, France

  • Venue:
  • ICICS'10 Proceedings of the 12th international conference on Information and communications security
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce in this paper a technique in which we apply correlation analysis using only one execution power curve during an exponentiation to recover the whole secret exponent manipulated by the chip. As in the Big Mac attack from Walter, longer keys may facilitate this analysis and success will depend on the arithmetic coprocessor characteristics. We present the theory of the attack with some practical successful results on an embedded device and analyze the efficiency of classical countermeasures with respect to our attack. Our technique, which uses a single exponentiation curve, cannot be prevented by exponent blinding. Also, contrarily to the Big Mac attack, it applies even in the case of regular implementations such as the square and multiply always or the Montgomery ladder. We also point out that DSA and Diffie-Hellman exponentiations are no longer immune against CPA. Then we discuss the efficiency of known countermeasures, and we finally present some new ones.