3 search results - page 1 / 1 » Breaking RSA Generically Is Equivalent to Factoring |
EUROCRYPT
2009
Springer
14 years 5 months ago
2009
Springer
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...
ASIACRYPT
2006
Springer
13 years 8 months ago
2006
Springer
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...
ASIACRYPT
2009
Springer
13 years 11 months ago
2009
Springer
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...