Paper 2017/624

Fast Leakage Assessment

Oscar Reparaz, Benedikt Gierlichs, and Ingrid Verbauwhede


We describe a fast technique for performing the computationally heavy part of leakage assessment, in any statistical moment (or other property) of the leakage samples distributions. The proposed technique outperforms by orders of magnitude the approach presented at CHES 2015 by Schneider and Moradi. We can carry out evaluations that before took 90 CPU-days in 4 CPU-hours (about a 500-fold speed-up). As a bonus, we can work with exact arithmetic, we can apply kernel-based density estimation methods, we can employ arbitrary pre-processing functions such as absolute value to power traces, and we can perform information-theoretic leakage assessment. Our trick is simple and elegant, and lends itself to an easy and compact implementation. We fit a prototype implementation in about 130 lines of C code.

Available format(s)
Publication info
Published by the IACR in Ches 2017
leakage assessmentefficient computationside-channel analysiscountermeasure
Contact author(s)
oscar reparaz @ esat kuleuven be
2017-06-27: received
Short URL
Creative Commons Attribution


      author = {Oscar Reparaz and Benedikt Gierlichs and Ingrid Verbauwhede},
      title = {Fast Leakage Assessment},
      howpublished = {Cryptology ePrint Archive, Paper 2017/624},
      year = {2017},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.