|
A WWW Based Computing Project Undertaken at NPAC - RSA Factoring
|
|
In the RSA public key cryptosystem the secret key can be derived from the public key,
|
|
If one is able to find the factorisation of a number that is part of the public key. Thus, the security of RSA depends on the difficulty of factoring.
|
|
Since factoring large numbers is believed to be hard - RSA is believed to be secure.
|
|
RSA interested in factoring to be able to evaluate the security of RSA implementations: how large should the numbers so that RSA becomes impossible to break?
|
