Improved collision-correlation power analysis on first order protected AES

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

  • Affiliations:
  • XLIM-CNRS, Université de Limoges, France;XLIM-CNRS, Université de Limoges, France and INSIDE Secure, Aix-en-Provence, France;XLIM-CNRS, Université de Limoges, France and INSIDE Secure, Aix-en-Provence, France;INSIDE Secure, Aix-en-Provence, France;INSIDE Secure, Aix-en-Provence, France and Institut de Mathématiques de Bordeaux, France

  • Venue:
  • CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The recent results presented by Moradi et al. on AES at CHES 2010 and Witteman et al. on square-and-multiply always RSA exponentiation at CT-RSA 2011 have shown that collision-correlation power analysis is able to recover the secret keys on embedded implementations. However, we noticed that the attack published last year by Moradi et al. is not efficient on correctly first-order protected implementations. We propose in this paper improvements on collision-correlation attacks which require less power traces than classical second-order power analysis techniques.We present here two new methods and show in practice their real efficiency on two first-order protected AES implementations. We also mention that other symmetric embedded algorithms can be targeted by our new techniques.