A DFA on AES based on the entropy of error distributions

Abstract : Differential fault analysis (DFA) techniques have been widely studied during the past decade. To our best knowledge, most DFA techniques on the Advanced Encryption Standard (AES) either impose strong constraints on the fault injection process or require numerous faults in order to recover the secret key. This article presents a simple methodology based on information theory which allows to adapt the number of required faults for the analysis to the fault injection process. With this technique, the constraints on the fault model to recover the last round key are considerably lowered. Additionally, entropy is proposed as a tool to apprehend the most complex fault models in DFA. A practical realization and simulations are presented to illustrate our methodology.
Type de document :
Communication dans un congrès
FDTC 2012, Sep 2012, Leuven, Belgium. pp.34, 2012
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00742642
Contributeur : Hélène Le Bouder <>
Soumis le : mardi 16 octobre 2012 - 17:21:41
Dernière modification le : jeudi 9 août 2018 - 12:04:05

Identifiants

  • HAL Id : emse-00742642, version 1

Collections

Citation

Ronan Lashermes, Guillaume Reymond, Jean-Max Dutertre, Jacques Fournier, Bruno Robisson, et al.. A DFA on AES based on the entropy of error distributions. FDTC 2012, Sep 2012, Leuven, Belgium. pp.34, 2012. 〈emse-00742642〉

Partager

Métriques

Consultations de la notice

121