An exploration of the kolmogorov-smirnov test as a competitor to mutual information analysis

  • Authors:
  • Carolyn Whitnall;Elisabeth Oswald;Luke Mather

  • Affiliations:
  • Department of Computer Science, University of Bristol, Bristol, UK;Department of Computer Science, University of Bristol, Bristol, UK;Department of Computer Science, University of Bristol, Bristol, UK

  • Venue:
  • CARDIS'11 Proceedings of the 10th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

A theme of recent side-channel research has been the quest for distinguishers which remain effective even when few assumptions can be made about the underlying distribution of the measured leakage traces. The Kolmogorov-Smirnov (KS) test is a well known non-parametric method for distinguishing between distributions, and, as such, a perfect candidate and an interesting competitor to the (already much discussed) mutual information (MI) based attacks. However, the side-channel distinguisher based on the KS test statistic has received only cursory evaluation so far, which is the gap we narrow here. This contribution explores the effectiveness and efficiency of Kolmogorov-Smirnov analysis (KSA), and compares it with mutual information analysis (MIA) in a number of relevant scenarios ranging from optimistic first-order DPA to multivariate settings. We show that KSA shares certain ‘generic' capabilities in common with MIA whilst being more robust to noise than MIA in univariate settings. This has the practical implication that designers should consider results of KSA to determine the resilience of their designs against univariate power analysis attacks.