Question: First express your answers without computing modular exponentiations. Then use a computational aid to complete these computations.
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.)