ETH Zürich » Computer Science » Theory » Cryptography

Publications: Abstract

Breaking RSA Generically is Equivalent to Factoring

Divesh Aggarwal and Ueli Maurer

We show that a generic ring algorithm for breaking RSA in $\mathbb{Z}_N$ 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 $\mathbb{Z}_N$. This provides new evidence that breaking RSA may be equivalent to factoring the modulus.