Proof of RSA
We do a quick and dirty proof the correctness of the RSA algorithm.
To prove it we need Fermats Little Theorem
Proof of Fermats Little Theorem
Proof of RSA correctness using Fermats Little Theorem
Remember totient(pq) = (p-1)(q-1)
Obviously raw RSA is vulnerable to chosen cipher text and chosen plain text attacks, but it's still kinda fun to see a simple proof of correctness