Paper 2021/1558 Original: eprint.iacr.org/2021/1558 ↗

RSA Key Recovery from Digit Equivalence Information

Chitchanok Chuengsatiansup
Andrew Feutrill
Rui Qi Sim
Yuval Yarom
Abstract

The seminal work of Heninger and Shacham (Crypto 2009) demonstrated a method for reconstructing secret RSA keys from artial information of the key components. In this paper we further investigate this approach but apply it to a different context that appears in some side-channel attacks. We assume a fixed-window exponentiation algorithm that leaks the equivalence between digits, without leaking the value of the digits themselves. We explain how to exploit the side-channel information with the Heninger-Shacham algorithm. To analyse the complexity of the approach, we model the attack as a Markov process and experimentally validate the accuracy of the model. Our model shows that the attack is feasible in the commonly used case where the window size is 5.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
History
2022-06-05: last updated
2021-11-29: published
Short URL
https://ia.cr/2021/1558
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2021/1558,
      author = {Chitchanok Chuengsatiansup and Andrew Feutrill and Rui Qi Sim and Yuval Yarom},
      title = {RSA Key Recovery from Digit Equivalence Information},
      howpublished = {Cryptology {ePrint} Archive, Paper 2021/1558},
      year = {2021},
      url = {https://eprint.iacr.org/2021/1558}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.