Paper 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.
Note: The Figure 8 has been updated to reflect the best bound from "Alexandre Duc, Sebastian Faust, and François-Xavier Standaert. Making Masking Security Proofs Concrete - Or How to Evaluate the Security of Any Leaking Device. In Elisabeth Oswald and Marc Fischlin, editors, Advances in Cryptology - EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part I, volume 9056 of Lecture Notes in Computer Science, pages 401–429. Springer, 2015."
Metadata
- Available format(s)
- Category
- Implementation
- Publication info
- Preprint. MINOR revision.
- Keywords
- Side-Channel AnalysisInformation TheoryGuessing EntropySuccess Rate.
- Contact author(s)
- sylvain guilley @ secure-ic com
- History
- 2021-09-25: last of 4 revisions
- 2019-05-20: received
- See all versions
- Short URL
- https://ia.cr/2019/491
- License
-
CC BY