Communication Dans Un Congrès Année : 2024

What can Information Guess? Guessing Advantage vs. Rényi Entropy for Small Leakages

Résumé

We leverage the Gibbs inequality and its natural generalization to Rényi entropies to derive closed-form paramet- ric expressions of the optimal lower bounds of ρth-order guessing entropy (guessing moment) of a secret taking values on a finite set, in terms of the Rényi-Arimoto α-entropy. This is carried out in an non-asymptotic regime when side information may be available. The resulting bounds yield a theoretical solution to a fundamental problem in side-channel analysis: Ensure that an adversary will not gain much guessing advantage when the leakage information is sufficiently weakened by proper countermeasures in a given cryptographic implementation. Practical evaluation for classical leakage models show that the proposed bounds greatly improve previous ones for analyzing th

Fichier principal
Vignette du fichier
202401beguinotrioul.pdf (420.69 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
licence

Dates et versions

hal-05074577 , version 1 (20-05-2025)

Licence

Identifiants

Citer

Julien Béguinot, Olivier Rioul. What can Information Guess? Guessing Advantage vs. Rényi Entropy for Small Leakages. 2024 IEEE International Symposium on Information Theory (ISIT), Jul 2024, Athens, Greece. pp.2963-2968, ⟨10.1109/ISIT57864.2024.10619150⟩. ⟨hal-05074577⟩
1787 Consultations
198 Téléchargements

Altmetric

Partager

  • More