| RSA Details |
|
|
|
|
|
|
|
|
|
|
|
| • | Encryption: Cyphertext = (Cleartext)e mod n |
|||||||||
| • | Decryption: Cleartext = (Cyphertext)d mod n |
|||||||||
| • | Typical
d will be on the order of 500 to 700 bits |
|||||||||
| • | The
cost of the algorithm is between 1 and 2 |
|||||||||
| the
size of n, |
||||||||||
| – | Each
operation is a giant shift and add (multiply by a |
|||||||||
| power
of 2) |
||||||||||
