Breaking RSA May Be Easier Than Factoring (Extended Abstract)

We provide evidence that breaking low-exponent rsa cannot be equivalent to factoring integers. We show that an algebraic reduction from factoring to breaking low-exponent rsa can be converted into an e cient factoring algorithm. Thus, in e ect an oracle for breaking rsa does not help in factoring integers. Our result suggests an explanation for the lack of progress in proving that breaking rsa is equivalent to factoring. We emphasize that our results do not expose any speci c weakness in the rsa system