I'm trying to find
3185^2753 mod 3233
to decode a RSA message. How can I do it? What is the theorem behind this, if any?
The original question is:
What is the original message encrypted using the RSA system with n=53·61 and e=17 if the encrypted message is 3185 2038 2460 2550? (To decrypt, first find the decryption exponent d, which is the inverse of e=17 modulo 52·60.)