Paper 2010/441 Original: eprint.iacr.org/2010/441 ↗
Provably Secure Higher-Order Masking of AES
Abstract
Implementations of cryptographic algorithms are vulnerable to Side Channel Analysis (SCA). To counteract it, masking schemes are usually involved which randomize key-dependent data by the addition of one or several random value(s) (the masks). When $d$th-order masking is involved (i.e. when $d$ masks are used per key-dependent variable), the complexity of performing an SCA grows exponentially with the order $d$. The design of generic $d$th-order masking schemes taking the order $d$ as security parameter is therefore of great interest for the physical security of cryptographic implementations. This paper presents the first generic $d$th-order masking scheme for AES with a provable security and a reasonable software implementation overhead. Our scheme is based on the hardware-oriented masking scheme published by Ishai et al. at Crypto 2003. Compared to this scheme, our solution can be efficiently implemented in software on any general-purpose processor. This result is of importance considering the lack of solution for $d\geq 3$.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2010-08-17: last updated
- 2010-08-17: published
- Short URL
- https://ia.cr/2010/441
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2010/441,
author = {Matthieu Rivain and Emmanuel Prouff},
title = {Provably Secure Higher-Order Masking of AES},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/441},
year = {2010},
url = {https://eprint.iacr.org/2010/441}
}