| 1 |
A WWW Based Computing Project Undertaken at NPAC - RSA Factoring
|
| 2 |
Anyone can encrypt a message using the public key that belongs to the intended recipient, but only parties that know the corresponding secret key can decrypt the encrypted message.
|
| 3 |
The secrecy of the secret key, and therefore the security of the public keycryptosystem, depends on the fact that it is computationally infeasible to derive the secret key from the public key.
|
| 4 |
If that would be easy, anyone would be able to decrypt intercepted messages; if that is impossible, then the system is secure.
|
