A coding-theoretic approach to recovering noisy RSA keys

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7658 LNCS, Issue , 2012, Pages 386-403

  Paterson, Kenneth G ^a   Polychroniadou, Antigoni ^a   Sibborn, Dale L ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CODING THEORY; DERIVE BOUNDS; KEY BITS; LIST DECODING; NOISY VERSIONS; PRIVATE KEY; RANDOM CODING; RSA KEY RECOVERY; RSA PRIVATE KEY; USE CONCEPT;

COMPUTER PROGRAMMING; CRYPTOGRAPHY; RECOVERY; SECURITY OF DATA;

ALGORITHMS;

EID: 84871541596     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-34961-4_24     Document Type: Conference Paper

References (16)

1. Boneh, D.: Twenty years of attacks on the RSA cryptosystem. Notices of the American Mathematical Society 46(2), 203-313 (1999)
2. Brumley, D., Boneh, D.: Remote timing attacks are practical. Computer Networks 48(5), 701-716 (2005)
3. Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptology 10(4), 233-260 (1997)
4. Elias, P.: List decoding for noisy channels. Technical Report 335, Research Laboratory of Electronics. MIT (1957)
5. Guruswami, V.: Algorithmic results in list decoding. Foundations and Trends in Theoretical Computer Science 2(2) (2006)
6. Alex Halderman, J., Schoen, S.D., Heninger, N., Clarkson, W., Paul, W., Calandrino, J.A., Feldman, A.J., Appelbaum, J., Felten, E.W.: Lest we remember: Cold boot attacks on encryption keys. In: van Oorschot, P.C. (ed.) USENIX Security Symposium, pp. 45-60. USENIX Association (2008)
7. Alex Halderman, J., Schoen, S.D., Heninger, N., Clarkson, W., Paul, W., Calandrino, J.A., Feldman, A.J., Appelbaum, J., Felten, E.W.: Lest we remember: cold-boot attacks on encryption keys. Commun. ACM 52(5), 91-98 (2009)
8. Henecka, W., May, A., Meurer, A.: Correcting Errors in RSA Private Keys. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 351-369. Springer, Heidelberg (2010)
9. Heninger, N., Shacham, H.: Reconstructing RSA Private Keys from Random Key Bits. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 1-17. Springer, Heidelberg (2009)
10. Herrmann, M., May, A.: Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 406-424. Springer, Heidelberg (2008)
11. Kocher, P.C.: Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104-113. Springer, Heidelberg (1996)
12. May, A.: Using LLL-reduction for solving RSA and factorization problems: A survey. In: Nguyen, P. (ed.) Proceedings of LLL+25, p. 3 (June 2007)
13. Sarkar, S., Maitra, S.: More on correcting errors in RSA private keys: Breaking CRT-RSA with low weight decryption exponents. Cryptology ePrint Archive, Report 2012/106 (2012);
14. To appear at CHES (2012)
15. Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal 27, 379-423, 623-656 (1948)
16. Yilek, S., Rescorla, E., Shacham, H., Enright, B., Savage, S.: When private keys are public: results from the 2008 Debian OpenSSL vulnerability. In: Feldmann, A., Mathy, L. (eds.) Internet Measurement Conference, pp. 15-27. ACM (2009)