| 1 |
RSA stands for inventors: Rivest Shamir and Adleman
|
| 2 |
Take a number n = p * q where p and q are primes
|
| 3 |
Choose a "suitable" number e
|
| 4 |
Public key is <e,n> and basic encryption algorithm takes message m to be encrypted and forms
|
| 5 |
Decryption involves private key d which is found so that
-
d * e = 1 mod((p-1)(q-1))
|
| 6 |
Then m = cd mod(n)
|
| 7 |
As factorization is computationally infeasible (for n of 512 bits in length or more), this encryption cannot be broken.
-
Maybe should increase this to n=1024 as recently much progress in nifty factorizations
|
