Difference between revisions of "Joan Daemen"

From ESC2013
Jump to: navigation, search
(Created page with "'''Title:''' Differential Power Analysis and Keccak '''Abstract:''' We analyze the security of straightforward and three-share hardware implementations of Keccak against diff...")
 
 
(One intermediate revision by the same user not shown)
Line 2: Line 2:
  
 
'''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.
 
'''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.
 +
 +
[[Media:DPAandKeccakESC2013.pdf|slides]]

Latest revision as of 15:28, 19 January 2013

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.

slides