Difference between revisions of "RSA"
Jump to navigation
Jump to search
(Created page with "Proof of RSA") |
|||
| (3 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| − | Proof of RSA | + | == 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 == | ||
| + | |||
| + | [[File:FLT-1s.jpeg]] | ||
| + | |||
| + | |||
| + | |||
| + | == Proof of RSA correctness using Fermats Little Theorem == | ||
| + | |||
| + | Remember totient(pq) = (p-1)(q-1) | ||
| + | |||
| + | [[File:RSA-1s.jpg]] | ||
| + | |||
| + | |||
| + | 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 | ||
| + | |||
| + | |||
| + | Xxx | ||
| + | Kate | ||
Latest revision as of 14:56, 6 December 2015
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
Xxx
Kate