Cryptology ePrint Archive: Report 2019/491

Best Information is Most Successful

Eloi de Cherisey and Sylvain Guilley and Olivier Rioul and Pablo Piantanida

Abstract: Using information-theoretic tools, this paper establishes a mathematical link between the probability of success of a side-channel attack and the minimum number of queries to reach a given success rate, valid for any possible distinguishing rule and with the best possible knowledge on the attacker's side. This link is a lower bound on the number of queries highly depends on Shannon's mutual information between the traces and the secret key. This leads us to derive upper bounds on the mutual information that are as tight as possible and can be easily calculated. It turns out that, in the case of an additive white Gaussian noise, the bound on the probability of success of any attack is directly related to the signal to noise ratio. This leads to very easy computations and predictions of the success rate in any leakage model.

Category / Keywords: implementation / Side-Channel Analysis, Information Theory, Guessing Entropy, Success Rate.

Original Publication (with minor differences): IACR-CHES-2019

Date: received 13 May 2019, last revised 25 Sep 2021

Contact author: sylvain guilley at secure-ic com

Available format(s): PDF | BibTeX Citation

Note: Mention that the improvement of the bound in this paper compared to Duc et al. (Eurocrypt 2015) is because the latter paper resorts to Pinsker’s inequality.[with the new PDF file attached!].

Also update the two graphs in Fig. 5 to fix the plotted curves captions in the "key box" (issue kindly reported by Wei Cheng).

Version: 20210925:171712 (All versions of this report)

Short URL: ia.cr/2019/491


[ Cryptology ePrint archive ]