Best Information is Most Successful
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...
Main Authors: | Eloi de Chérisey, Sylvain Guilley, Olivier Rioul, Pablo Piantanida |
---|---|
Format: | Article |
Language: | English |
Published: |
Ruhr-Universität Bochum
2019-02-01
|
Series: | Transactions on Cryptographic Hardware and Embedded Systems |
Subjects: | |
Online Access: | https://tches.iacr.org/index.php/TCHES/article/view/7385 |
Similar Items
-
Tight and Scalable Side-Channel Attack Evaluations through Asymptotically Optimal Massey-like Inequalities on Guessing Entropy
by: Andrei Tănăsescu, et al.
Published: (2021-11-01) -
The Interplay between Error, Total Variation, Alpha-Entropy and Guessing: Fano and Pinsker Direct and Reverse Inequalities
by: Olivier Rioul
Published: (2023-06-01) -
The Need for Speed: A Fast Guessing Entropy Calculation for Deep Learning-Based SCA
by: Guilherme Perin, et al.
Published: (2023-02-01) -
GE vs GM: Efficient side-channel security evaluations on full cryptographic keys
by: Anca Rădulescu, et al.
Published: (2022-08-01) -
GE vs GM: Efficient side-channel security evaluations on full cryptographic keys
by: Anca Rădulescu, et al.
Published: (2022-08-01)