@SEJPM Umm… Certainly one can efficiently compute $m^{e^{-1}}$ if one can efficiently factor $n$, but the converse is not known to be true, unless $e = 2$. That is, the RSA problem is not harder than integer factorization but it could conceivably be easier.
