On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms

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 some evidence towards the validity of this equivalence. We show that any ecient generic ring algorithm which solves the (exible) low-exponent RSA problem can be converted into an ecient factoring algorithm. Thus, the low-exponent RSA problem is intractable w.r.t. generic ring algorithms provided that factoring is hard.

• Type: Conference
• Year: 2006
• Where: ASIACRYPT
• Authors: Gregor Leander, Andy Rupp
• Keywords: ASIACRYPT 2006, Cryptology, Generic Ring Algorithms, Low-exponent Rsa Problem, RSA Problem