Recovering Secrets From Prefix-Dependent Leakage - Inria - Institut national de recherche en sciences et technologies du numérique
Article Dans Une Revue Journal of Mathematical Cryptology Année : 2020

Recovering Secrets From Prefix-Dependent Leakage

Rémi Géraud
  • Fonction : Auteur
Sylvain Guilley
Mehdi Tibouchi
  • Fonction : Auteur

Résumé

Abstract We discuss how to recover a secret bitstring given partial information obtained during a computation over that string, assuming the computation is a deterministic algorithm processing the secret bits sequentially. That abstract situation models certain types of side-channel attacks against discrete logarithm and RSA-based cryptosystems, where the adversary obtains information not on the secret exponent directly, but instead on the group or ring element that varies at each step of the exponentiation algorithm. Our main result shows that for a leakage of a single bit per iteration, under suitable statistical independence assumptions, one can recover the whole secret bitstring in polynomial time. We also discuss how to cope with imperfect leakage, extend the model to k -bit leaks, and show how our algorithm yields attacks on popular cryptosystems such as (EC)DSA.
Fichier principal
Vignette du fichier
10.1515_jmc-2015-0048.pdf (481.83 Ko) Télécharger le fichier
Origine Publication financée par une institution

Dates et versions

hal-03933723 , version 1 (20-09-2023)

Licence

Identifiants

Citer

Houda Ferradi, Rémi Géraud, Sylvain Guilley, David Naccache, Mehdi Tibouchi. Recovering Secrets From Prefix-Dependent Leakage. Journal of Mathematical Cryptology, 2020, 14 (1), pp.15-24. ⟨10.1515/jmc-2015-0048⟩. ⟨hal-03933723⟩
18 Consultations
10 Téléchargements

Altmetric

Partager

More