Attacks on RSA: Difference between revisions
imported>Sandy Harris (→TWIRL) |
John Leach (talk | contribs) m (Text replacement - "{{subpages}}" to "{{PropDel}}<br><br>{{subpages}}") |
||
| (13 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
A number of methods have been proposed for attacking the [[RSA]] | {{PropDel}}<br><br>{{subpages}} | ||
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#RSA_and_factoring | 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. | Any efficient solution to the [[integer factorisation]] problem would break RSA; see the [[RSA algorithm#RSA_and_factoring | 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 == | == Weiner attack == | ||
[[Michael Weiner]] proposed an attack <ref>{{cite paper | |||
Michael Weiner proposed an attack <ref>{{cite paper | |||
| title=Cryptanalysis of short RSA secret exponents | | title=Cryptanalysis of short RSA secret exponents | ||
| author=Wiener, M.J. | | author=Wiener, M.J. | ||
| journal= IEEE Transactions on Information Theory | | journal=IEEE Transactions on Information Theory | ||
| volume= 36 | | volume=36 | ||
| issue= 3 | | issue=3 | ||
| date=May 1990 | | date=May 1990}}</ref> based on [[continued fraction]]s 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 == | == TWIRL == | ||
'''The Weizmann Institute Relation Locator''' <ref>{{cite paper | |||
'''The | |||
| author=Adi Shamir & Eran Tromer | | author=Adi Shamir & Eran Tromer | ||
| title=On the cost of factoring RSA-1024 | | title=On the cost of factoring RSA-1024 | ||
| Line 23: | Line 21: | ||
| date=2003 | | date=2003 | ||
| url=http://people.csail.mit.edu/tromer/ | | url=http://people.csail.mit.edu/tromer/ | ||
}}</ref>, developed by [[Adi Shamir]] (The 'S' in RSA) and [[ | }}</ref>, 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 [http://www.rsa.com/rsalabs/node.asp?id=2004]. | RSA Security have commented [http://www.rsa.com/rsalabs/node.asp?id=2004]. | ||
==References== | |||
{{reflist|2}} | |||
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
|
||
