Nach fünf Jahren gefunden: Schlüssel für DES/RC5 Verschlüsselung

#1 Bedford, MA, Thursday, September 26, 2002 — RSA Laboratories, the research center of RSA Security Inc. (Nasdaq: RSAS), the most trusted name in e-security®, today announced that a coordinated team of computer programmers and enthusiasts, known as distributed.net, has solved the RC5-64 Secret-Key Challenge. The distributed.net team solved the challenge in approximately four years, using 331,252 volunteers and their machines. Distributed.net receives a cash prize of $10,000 for solving the challenge.
Established in 1997, RSA Laboratories’ Secret-Key Challenge is offered to quantify the strength of symmetric encryption algorithms such as DES and the RC5® algorithm with various key sizes. By sponsoring an actual contest, RSA Laboratories helps the industry confirm theoretical estimates, and through this constant evaluation, vendors are motivated to continue to improve their security solutions. The distributed.net consortium utilized the idle time of computers throughout the world to search through the list of all possible 64-bit keys for RSA Security’s RC5 algorithm to find the one secret key selected at random by RSA Laboratories that decrypts a given message correctly.

RSA Laboratories sponsors a series of cryptographic challenges that allow individuals or groups to attempt to solve various encryption “puzzles” for cash prizes. The RC5-64 Challenge is one of a series of contests held to determine the difficulty of finding a symmetric encryption key by exhaustive search (trial-and-error). Previous contests include the DES Challenge, the RC5-40 Challenge and the RC5-56 Challenge.

“We’re very appreciative of all the volunteers who offered their time and computer’s idle processing time to help solve this challenge,” said David McNett, distributed.net co-founder and president. “We have once again shown how collective computing power can be applied to security technology with ordinary PC’s. We look forward to future RSA Laboratories-sponsored challenges that will assist in helping the cryptographic community gauge the strength of an algorithm or application against exhaustive key search.”

“RSA Security congratulates the distributed.net team in solving the RC5-64 Secret-Key Challenge,” said Burt Kaliski, chief scientist at RSA Laboratories. “We appreciate the persistence of distributed.net and the many individuals involved in completing the search for this one key. Their work helps the industry confirm how much work is involved to search exhaustively for a key — and how a huge volume of computing time can be harnessed. The various challenges we sponsor are very useful for tracking the state of cryptographic achievements and helping ensure that organizations are maintaining the highest levels of security to protect their most critical data assets.”
__________
powered by http://different-thinking.de - Netze, Protokolle, Sicherheit, ...

#2 zur Ergänzung noch kurz was auf deutsch

Zitat

distributed.net knackt RC5-64-Schlüssel 15.769.938.165.961.326.592 Schlüssel überprüft
"Some things are better left unread", so die mit einem 64-Bit RC5-Key verschlüsselte Botschaft, die am 14. Juli 2002 mit Hilfe von distributed.net geknackt wurde. Der "Glückliche" war ein Pentium-III mit 450 MHz aus Tokyo, der den korrekten Schlüssel "0x63DE7DC154F4D03" übermittelte.Es soll aber bis zum 12. August gedauert haben, bis das Knacken des Schlüssels auffiel, da einige Scripte auf dem zentralen Server hängen geblieben waren.
Damit gelang es dem Projekt für verteiltes Rechnen nach 1.757 und 58.747.597.657 "Workunits" den richtigen Schlüssel zu finden. Insgesamt 331.252 Personen nahmen an dem Projekt teil, die zusammen 15.769.938.165.961.326.592 Schlüssel testeten.
An seinem besten Tag verarbeitete das Projekt 86.950.894 "Workunits", 0,12 Prozent der Gesamtaufgabe. In Spitzenzeiten wurden bis zu 270.147.024 kKeys/Sekunde verarbeitet, was etwa der Rechenleistung von 45.998 AMD Athlon-XP-Maschinen mit 2 GHz entspricht.

Quelle, Golem.de
__________
Durchsuchen --> Aussuchen --> Untersuchen