Partial Key Exposure Attacks on RSA up to Full Size Exponents

We present several attacks on RSA that factor the modulus in polynomial time under the condition that a fraction of the most significant bits or least significant bits of the private exponent is available to the attacker. Our new attacks on RSA are the first attacks of this type that work up to full size public or private exponent.

• Type: Conference
• Year: 2005
• Where: EUROCRYPT
• Authors: Matthias Ernst, Ellen Jochemsz, Alexander May, Benne de Weger
• Keywords: Cryptography, EUROCRYPT 2005, Polynomial Time, Private Exponent, Significant Bits