zbMATH — the first resource for mathematics

Recovering RSA secret keys from noisy key bits with erasures and errors. (English) Zbl 1314.94081
Kurosawa, Kaoru (ed.) et al., Public-key cryptography – PKC 2013. 16th international conference on practice and theory in public-key cryptography, Nara, Japan, February 26–March 1, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36361-0/pbk). Lecture Notes in Computer Science 7778, 180-197 (2013).
Summary: We discuss how to recover RSA secret keys from noisy key bits with erasures and errors. There are two known algorithms recovering original secret keys from noisy keys. At Crypto 2009 [Lect. Notes Comput. Sci. 5677, 1–17 (2009; Zbl 1252.94072)], N. Heninger and H. Shacham proposed a method for the case where an erroneous version of secret keys contains only erasures. Subsequently, W. Henecka et al. proposed a method for an erroneous version containing only errors at Crypto 2010 [Lect. Notes Comput. Sci. 6223, 351–369 (2010; Zbl 1283.94067)]. For physical attacks such as side-channel and cold boot attacks, we need to study key recovery from a noisy secret key containing both erasures and errors. In this paper, we propose a method to recover a secret key from such an erroneous version and analyze the condition for error and erasure rates so that our algorithm succeeds in finding the correct secret key in polynomial time. We also evaluate a theoretical bound to recover the secret key and discuss to what extent our algorithm achieves this bound.
For the entire collection see [Zbl 1258.94004].

94A60 Cryptography
Full Text: DOI