Maximal Information Coefficient Analysis

Yanis Linge; Cecile Dumas; Sophie Lambert-Lacroix

Paper 2014/012

Maximal Information Coefficient Analysis

Yanis Linge, Cecile Dumas, and Sophie Lambert-Lacroix

Abstract

Abstract In the domain of the Side Channel Attacks, various statistical tools have succeeded to retrieve a secret key, as the Pearson coefficient or the Mutual Information. In this paper we propose to study the Maximal Information Coefficient (MIC) which is a non-parametric method introduced by Reshef et al. [13] to compare two random variables. The MIC is based on the mutual information but it is easier to implement and is robust to the noise. We show how apply this tool in the particular case of the side channel attacks. As in statistics, benefits only appears with drawbacks, the computing complexity of the MIC is high. Therefore, we propose a way to efficiently compute the MIC. The obtained attack called the Maximal Information Coefficient Analysis is compared to the CPA [3] and the MIA [8]. The results show the interest of this approach when the leakage is noisy and bad modeleled.

Metadata

Available format(s): PDF
Publication info: Preprint. MINOR revision.
Contact author(s): yanis linge @ emse fr
History: 2014-01-07: received
Short URL: https://ia.cr/2014/012
License: CC BY

BibTeX

@misc{cryptoeprint:2014/012,
      author = {Yanis Linge and Cecile Dumas and Sophie Lambert-Lacroix},
      title = {Maximal Information Coefficient Analysis},
      howpublished = {Cryptology {ePrint} Archive, Paper 2014/012},
      year = {2014},
      url = {https://eprint.iacr.org/2014/012}
}