Breaking RSA Generically Is Equivalent to Factoring

We show that a generic ring algorithm for breaking RSA in ZN can be converted into an algorithm for factoring the corresponding RSA-modulus N. Our results imply that any attempt at breaking RSA without factoring N will be non-generic and hence will have to manipulate the particular bit-representation of the input in ZN . This provides new evidence that breaking RSA may be equivalent to factoring the modulus.

• Type: Conference
• Year: 2009
• Where: EUROCRYPT
• Authors: Divesh Aggarwal, Ueli M. Maurer
• Keywords: Corresponding Rsa-modulus N, Cryptography, EUROCRYPT 2009, Generic Ring Algorithm