RSA Secret-Key Challenge


RSA Secret-Key Challenge

The RSA Secret-Key Challenge was a series of cryptographic contests that were started by RSA Laboratories on January 28, 1997 with the intent of helping to demonstrate the relative security of different encryption algorithms. The RSA Secret-Key Challenge is no longer active. [RSA Laboratories [http://www.rsa.com/rsalabs/node.asp?id=2100 The RSA Laboratories Secret-Key Challenge] . Retrieved on 2007-05-18.]

Contest details

For each contest, RSA had posted on its website a block of ciphertext and the random initialization vector used for encryption. To win, a contestant would have had to break the code by finding the original plaintext and the cryptographic key that will generate the posted ciphertext from the plaintext. The challenge consisted of one DES contest and twelve contests based around the block cipher RC5.

Each of the RC5-* contests is named after the variant of the RC5 cipher used. The name "RC5-w/r/b" indicates that the cipher used "w"-bit words, "r" rounds, and a key made up of "b" bytes. The contests are often referred to by the names of the corresponding distributed.net projects, for example RC5-32/12/9 is often known as RC5-72 due to the 72-bit key size.

The first contest was DES Challenge III (and was also part of the DES Challenges), and was completed in just 22 hours 15 minutes by distributed.net and the EFF's Deep Crack machine.

Distributed.net

The contests are associated with the distributed.net group, which had actively participated in the challenge by making use of distributed computing to perform a brute force attack.

RC5-32/12/7 was completed on 19 October 1997, with distributed.net finding the winning key in 250 days and winning the US$10,000 prize. The recovered plaintext was: "The unknown message is: It's time to move to a longer key length".

RC5-32/12/8 also carried a US$10,000 prize and was completed by distributed.net on 14 July 2002. It took the group 1,757 days to locate the key, revealing the plaintext: "The unknown message is: Some things are better left unread".

There were still eight remaining contests that had not yet been solved, RC5/32/12/9 through to RC5/32/12/16, each of which was a US$10,000 prize. Distributed.net had been working on RC5-32/12/9 and were over 0.472% through as of February 2008.

ee also

* RSA Factoring Challenge
* DES Challenges

External links

* [http://www.rsasecurity.com/rsalabs/node.asp?id=2100 Official contest page on the RSA website]
* [http://www.rsasecurity.com/rsalabs/node.asp?id=2103 Current status of all contests within the challenge]
* [http://distributed.net/rc5 Unofficial status page on Distributed.net]
* [http://stats.distributed.net/projects.php?project_id=8 Distributed.net's RC5-72 Project Statistics]

References


Wikimedia Foundation. 2010.

Look at other dictionaries:

  • RSA Factoring Challenge — The RSA Factoring Challenge was a challenge put forward by RSA Laboratories on March 18 1991 to encourage research into computational number theory and the practical difficulty of factoring large integers and cracking RSA keys used in… …   Wikipedia

  • RSA numbers — In mathematics, the RSA numbers are a set of large semiprimes (numbers with exactly two prime factors) that are part of the RSA Factoring Challenge. The challenge was to find the prime factors but it was declared inactive in 2007. [RSA… …   Wikipedia

  • RSA Security — Infobox Company company name = RSA, The Security Division of EMC company company type = Division (organization) of EMC Corporation company slogan = ? foundation = 1986 location = Bedford, Massachusetts key people = Arthur W. Coviello, Jr.,… …   Wikipedia

  • RSA-Kryptosystem — RSA ist ein asymmetrisches kryptographisches Verfahren, das sowohl zur Verschlüsselung als auch zur digitalen Signatur verwendet werden kann.[1] Es verwendet ein Schlüsselpaar, bestehend aus einem privaten Schlüssel, der zum Entschlüsseln oder… …   Deutsch Wikipedia

  • RSA-Algorithmus — RSA ist ein asymmetrisches Kryptosystem, das sowohl zur Verschlüsselung als auch zur digitalen Signatur verwendet werden kann. Es verwendet ein Schlüsselpaar bestehend aus einem privaten Schlüssel, der zum Entschlüsseln oder Signieren von Daten… …   Deutsch Wikipedia

  • RSA-Kryptologiesystem — RSA ist ein asymmetrisches Kryptosystem, das sowohl zur Verschlüsselung als auch zur digitalen Signatur verwendet werden kann. Es verwendet ein Schlüsselpaar bestehend aus einem privaten Schlüssel, der zum Entschlüsseln oder Signieren von Daten… …   Deutsch Wikipedia

  • RSA-Schema — RSA ist ein asymmetrisches Kryptosystem, das sowohl zur Verschlüsselung als auch zur digitalen Signatur verwendet werden kann. Es verwendet ein Schlüsselpaar bestehend aus einem privaten Schlüssel, der zum Entschlüsseln oder Signieren von Daten… …   Deutsch Wikipedia

  • RSA-Verfahren — RSA ist ein asymmetrisches Kryptosystem, das sowohl zur Verschlüsselung als auch zur digitalen Signatur verwendet werden kann. Es verwendet ein Schlüsselpaar bestehend aus einem privaten Schlüssel, der zum Entschlüsseln oder Signieren von Daten… …   Deutsch Wikipedia

  • RSA-Verschlüsselung — RSA ist ein asymmetrisches Kryptosystem, das sowohl zur Verschlüsselung als auch zur digitalen Signatur verwendet werden kann. Es verwendet ein Schlüsselpaar bestehend aus einem privaten Schlüssel, der zum Entschlüsseln oder Signieren von Daten… …   Deutsch Wikipedia

  • RSA-Verschlüsselungssystem — RSA ist ein asymmetrisches Kryptosystem, das sowohl zur Verschlüsselung als auch zur digitalen Signatur verwendet werden kann. Es verwendet ein Schlüsselpaar bestehend aus einem privaten Schlüssel, der zum Entschlüsseln oder Signieren von Daten… …   Deutsch Wikipedia


Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.