Correcting errors in RSA private keys

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

Volumn 6223 LNCS, Issue , 2010, Pages 351-369

  Henecka, Wilko ^a   May, Alexander ^a   Meurer, Alexander ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

error correction; RSA; statistical cryptanalysis

Indexed keywords

ERROR PRONES; ERROR RATE; EXPECTED TIME; FACTORIZATION ALGORITHMS; FREE INFORMATION; MOST SIGNIFICANT BIT; POLYNOMIAL-TIME; PROBABILISTIC ALGORITHM; PUBLIC KEYS; RSA; RSA PRIVATE KEY; SECRET KEY; STATISTICAL CRYPTANALYSIS;

CRYPTOGRAPHY; ERRORS; FACTORIZATION; HEURISTIC ALGORITHMS; POLYNOMIAL APPROXIMATION; PROBABILITY DENSITY FUNCTION; RECOVERY;

BIT ERROR RATE;

EID: 77956997077     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14623-7_19     Document Type: Conference Paper

References (11)

1. Boneh, D.: Twenty years of attacks on the rsa cryptosystem. Notices of the American Mathematical Society (AMS) 46(2), 203-213 (1999)
2. Boneh, D., Durfee, G., Frankel, Y.: An attack on RSA given a small fraction of the private key bits. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 25-34. Springer, Heidelberg (1998)
3. Coppersmith, D.: Small solutions to polynomial equations, and low exponent rsa vulnerabilities. J. Cryptology 10(4), 233-260 (1997)
4. Coron, J.-S., May, A.: Deterministic polynomial-time equivalence of computing the rsa secret key and factoring. J. Cryptology 20(1), 39-50 (2007)
5. Halderman, J.A., 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)
6. 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)
7. Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58(301), 13-30 (1963)
8. Maurer, U.M.: Factoring with an oracle. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 429-436. Springer, Heidelberg (1993)
9. Rivest, R.L., Shamir, A.: Efficient factoring based on partial information. In: Pichler, F. (ed.) EUROCRYPT 1985. LNCS, vol. 219, pp. 31-34. Springer, Heidelberg (1986)
10. RSA Laboratories. PKCS #1 v2.1: RSA Cryptography Standard (June 2002)
11. 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.) Proceedings of IMC 2009, pp. 15-27. ACM Press, New York (November 2009)