[Resource Topic] 2005/204: An Algebraic Masking Method to Protect AES Against Power Attacks

Welcome to the resource topic for 2005/204

An Algebraic Masking Method to Protect AES Against Power Attacks

Authors: Nicolas Courtois, Louis Goubin


The central question in constructing a secure and efficient masking method for AES is to address the interaction between additive masking
and the inverse S-box of Rijndael. All recently proposed methods to protect AES against power attacks try to avoid this problem and
work by decomposing the inverse in terms of simpler operations
that are more easily protected against DPA by generic methods.

In this paper, for the first time, we look at the problem in the face, and show that this interaction is not as intricate as it seems. In fact, any operation, even complex, can be directly protected against DPA of any given order, if it can be embedded in a group that has a compact representation.
We show that a secure computation of a whole masked inverse can be done directly in this way, using the group of homographic transformations over the projective space (but not exactly, with some non-trivial technicalities).
This is used to propose a general high-level algebraic method to protect AES against power attacks of any given order.

ePrint: https://eprint.iacr.org/2005/204

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .