RSA encryption
This problem is not very interesting. The math behind it is not very easy to figure out. But google can help a lot on this problem.
After I got the answer, I read the post by daniel.is.fischer and googled on the topic of m^e = m mod(p). I learned a lot from this problem.
No comments:
Post a Comment