Date Added: Jan 2013
Inspired by cold boot attacks, Heninger and Shacham (Crypto 2009) initiated the study of the problem of how to recover an RSA private key from a noisy version of that key. They gave an algorithm for the case where some bits of the private key are known with certainty. Their ideas were extended by Henecka, May and Meurer (Crypto 2010) to produce an algorithm that works when all the key bits are subject to error. In this paper, the authors bring a coding-theoretic viewpoint to bear on the problem of noisy RSA key recovery. This viewpoint allows user to cast the previous work as part of a more general framework.