This problem is for my discrete math class - so I hope this is in the right section.

Hope some1 can help me out :confused:Quote:

This problem is to be done using only the computing power of a pocket calculator. Write out all your work in step-by-step form showing all computations.

The Message M=9 is encrypted in the RSA system using p=11,q=13 and e =7 which is relatively prime to (p-1)(q-1)

a.)Encrypt M to get C , which is to be transmitted.

b.)find d, the inverse of e(mod(p-1)(q-1)).

c.)using d, recover the original message M.

Cheers