Recovering cryptographic keys from partial information, by example

Gabrielle de Micheli (1) , Nadia Heninger (2)

1 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
2 UC San Diego - University of California [San Diego]

Side-channel attacks targeting cryptography may leak only partial or indirect information about the secret keys. There are a variety of techniques in the literature for recovering secret keys from partial information. In this tutorial, we survey several of the main families of partial key recovery algorithms for RSA, (EC)DSA, and (elliptic curve) Diffie-Hellman, the public-key cryptosystems in common use today. We categorize the known techniques by the structure of the information that is learned by the attacker, and give simplified examples for each technique to illustrate the underlying ideas.

Domaines: Informatique [cs]; Cryptographie et sécurité [cs.CR]

Gabrielle de Micheli, Nadia Heninger. Recovering cryptographic keys from partial information, by example. 2020. ⟨hal-03045663⟩