Abstract. To prove or disprove the computational equivalence of solving the RSA problem and factoring integers is a longstanding open problem in cryptography. This paper provides s...
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...
At Eurocrypt 2009 Aggarwal and Maurer proved that breaking RSA is equivalent to factoring in the generic ring model. This model captures algorithms that may exploit the full algeb...