Title: Differential Power Analysis and Keccak
Abstract: We analyze the security of straightforward and three-share hardware implementations of Keccak against differential power analysis. We generalize this to any cryptographic primitive that is implemented as a sequence of quadratic functions. Starting from the analytical treatment of such distinguishers and information-theoretic arguments, we derive the success probability and required number of traces in the presence of algorithmic noise.
Joint talk with Gilles and Michaël.