RSA inversion problem ($m^e\equiv c(\mathrm{mod}n)$)

Recover a plaintext from an RSA cryptosystem ciphertext and the public key, without a supplied private key. Integer factorization of the modulus suffices; the existence of an efficient general reduction in the reverse direction is not known.