Location of Repository

DPA Attacks and S-Boxes

By Emmanuel Prouff

Abstract

Abstract. For the power consumption model called Hamming weight model, we rewrite DPA attacks in terms of correlation coefficients between two Boolean functions. We exhibit properties of S-boxes (also called (n, m)-functions) relied on DPA attacks. We show that these properties are opposite to the non-linearity criterion and to the propagation criterion. To quantify the resistance of an S-box to DPA attacks, we introduce the notion of transparency order of an S-box and we study this new criterion with respect to the non-linearity and to the propagation criterion.

Publisher: Springer
Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.416.6709
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.iacr.org/cryptodb/a... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.