Best Information is Most Successful Mutual Information and Success Rate in Side-Channel Analysis
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...
Saved in:
Published in | IACR transactions on cryptographic hardware and embedded systems pp. 49 - 79 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
28.02.2019
|
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
ISSN: | 2569-2925 2569-2925 |
DOI: | 10.46586/tches.v2019.i2.49-79 |