An efficient masking scheme for AES software implementations

  • Authors:
  • Elisabeth Oswald;Kai Schramm

  • Affiliations:
  • Institute for Applied Information Processing and Communciations (IAIK), TU Graz, Graz, Austria;Horst Görtz Institute for IT Security (HGI), Ruhr University Bochum, Germany, Bochum, Germany

  • Venue:
  • WISA'05 Proceedings of the 6th international conference on Information Security Applications
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The development of masking schemes to secure AES implementations against power-analysis attacks is a topic of ongoing research. The most challenging part in masking an AES implementation is the SubBytes operation because it is a non-linear operation. The current solutions are expensive to implement especially on small 8-bit processors; they either need many large tables or require a large amount of operations. In this article, we present a masking scheme that requires considerably less tables and considerably less operations than the previously presented schemes. We give a theoretical proof of security for our scheme and confirm it with actually performed DPA attacks.