Attacks on RSA

This article may be deleted soon.

|  | To oppose or discuss a nomination, please go to CZ:Proposed for deletion and follow the instructions.

For the monthly nomination lists, see Category:Articles for deletion.

| Main Article
| Discussion
| Related Articles  [?]
| Bibliography  [?]
| External Links  [?]
| Citable Version  [?]

|
|
|
|
|
|
|
|

This editable Main Article is under development and subject to a disclaimer.

[edit intro]

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[edit]

Michael Weiner proposed an attack [1] based on continued fractions which is effective if the exponent in the secret key is small. There have since been many papers proposing improvements on or variants of that attack.

## TWIRL[edit]

The Weizmann Institute Relation Locator [2], developed by Adi Shamir (The 'S' in RSA) and Eran Tromer, is a machine designed to speed up the sieving step in the number field sieve technique for integer factorisation.

RSA Security have commented [1].

## References[edit]

1. ↑ Wiener, M.J. (May 1990). "Cryptanalysis of short RSA secret exponents".
2. ↑ Adi Shamir & Eran Tromer (2003). On the cost of factoring RSA-1024.