Attacks on RSA: Difference between revisions
imported>Meg Taylor No edit summary |
John Leach (talk | contribs) m (Text replacement - "{{subpages}}" to "{{PropDel}}<br><br>{{subpages}}") |
||
| Line 1: | Line 1: | ||
{{subpages}} | {{PropDel}}<br><br>{{subpages}} | ||
A number of methods have been proposed for attacking the [[RSA cryptosystem]]. This article describes them. | A number of methods have been proposed for attacking the [[RSA cryptosystem]]. This article describes them. | ||
Latest revision as of 04:48, 8 April 2024
| This article may be deleted soon. | ||
|---|---|---|
 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 attackMichael 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. TWIRLThe 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
|
||
