Skip to Main content Skip to Navigation
New interface
Preprints, Working Papers, ...

Recovering cryptographic keys from partial information, by example

Gabrielle de Micheli 1 Nadia Heninger 2 
1 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata
Contributor : Gabrielle De Micheli Connect in order to contact the contributor
Submitted on : Tuesday, December 8, 2020 - 10:08:06 AM
Last modification on : Wednesday, November 30, 2022 - 11:22:07 AM
Long-term archiving on: : Tuesday, March 9, 2021 - 6:44:29 PM


Files produced by the author(s)


  • HAL Id : hal-03045663, version 1


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



Record views


Files downloads