Attacks on RSA

A number of methods have been proposed for attacking the RSA cryptosystem. This article describes them.

Any efficient solution to the integer factorisation problem would break RSA; see the RSA article for discussion. The difficulty with that approach is that no efficient solution is known. Cracking a large (say 1024 bits or more) RSA key with current factoring algorithms is not practical, even with massive parallelism.

Weiner attack

Michael Weiner proposed an attack based on continued fractions which is effective if the exponent in the secret key is small.

TWIRL

The Weizman Instiute Relation Locator [1].