| Active Distributed Computing Projects - Cryptography |
|
These links take you to other project categories on this site:
Mathematics Art Puzzles/Games Miscellaneous Distributed Human Projects Collaborative Knowledge Bases Charity See the bottom of this page for a description of the icons on the page. |
| Project Information | Project % Complete | Major Supported Platforms | |
|---|---|---|---|
| Cryptography | |||
|
Currently the RC5-72 and OGR25-P2 projects are active. Version 2.9013.500 of the client is available for most major platforms as of October 22, 2007. Pre-release version 2.9013.500 is available for many platforms as of July 5, 2007. Release candidate version 2.9015.504 is available for Linux [CellBE] (PlayStation 3) as of September 18, 2007. Note: client versions older than 2.9008.490 and personal proxies older than 431 cannot participate in the OGR25-P2 project. See a log of an IRC discussion forum with some of the project coordinators which took place on September 28, 2002. They discussed the results of the RC5-64 project and future directions for distributed.net. Use the RC5 key-rate calculator to see approximately what RC5 key-rate and OGR node-rate your CPU will produce. The calculator was updated by CalicoJak in January, 2003. |
RC5-72: 0.494% in 1,991 days
OGR25-P2: |
|
|
PrimeGrid is a test project for PerlBOINC, a Perl-language-based port of the
BOINC platform. The project's first
sub-project attempted to factor the number in the RSA
Factoring Challenge. Currently the project is running a sub-project,
Primegen, to generate a public sequential prime number database.
On February 28, 2007, the project reported its 100th prime to the prime pages. On November 26, 2006, the project began working with Twin Internet Prime Search, and is supporting a second sub-project to help that project. The project uses a BOINC-based client. See the BOINC platform information for the latest version of the BOINC client. Version 5.13 of the project's Prime Generator client is available as of May 16, 2006. Version 5.04 of the project's LLR Prime Search client is available as of November 25, 2006. Join a discussion forum about this project. |
190,789,011 credits |
|
|
|
The M4
message breaking project is attempting to break 3 encrypted
signals (messages) which were intercepted in the North Atlantic in 1942
and which are believed to be unbroken. These signals were presented by
Ralph Erskine in a
letter to
the journal Cryptologia in December, 1995. The signals were presumably
enciphered with the four rotor
Enigma M4 cipher
machine. The project
broke one
of the signals on February 20, 2006, and hopes to break the other two within
one month with enough participation. The project expects to crack each
cipher with 1 to 10 walks through the Enigma keyspace. See the project's
latest results.
The project cracked its first message on February 20, 2006. It cracked its second message on March 7, 2006. The project uses "a mixture of brute force and a hill climbing algorithm" to crack each cipher. The Enigma keyspace is too large for a brute force approach. The hill climbing algorithm tries to optimize the plugboard settings (which form a very large part of the keyspace) by changing the settings one step at a time and evaluating each step by determining how closely the deciphered plaintext matches the statistics of natural language. The scoring function uses Sinkov Statistics. The software client uses a Python script to download a workunit containing a range of 26^4 keys. It then uses a C program to test each key in the range, and then returns the best or most-fit result to the project server. See the M4 wiki for notes on running the client interactively, for running it on Mac OSX and Solaris, for running the client behind a firewall, and for many other useful tips. Note that there is no way to specify a user ID or to see your individual statistics. The client supports checkpointing, so it will restart at the point you stopped it the next time you run it. The latest version of the client is available for all supported platforms as of March 29. This version "avoids duplicate scrambler testing and has the ability to download new dictionaries. It also uses different naval dictionaries. Participants are encouraged to upgrade to the latest version as soon as possible. Join a mailing list about this project. |
ongoing |
|
|
HashClash
is "using techniques from the attack from Wang et
al., ... to find [MD5 hash] collisions which are more flexible:" these
collisions will help "clarify the nature of the vulnerabilities in
applications of MD5 that have been opened up by the collision finding methods
of Wang et al." The MD5 encryption algorithm was first broken in August,
2004, by a Chinese research team. This project attempts to improve on their
work by allowin the first blocks of two messages to be chosen at will instead
of being equal. The first phase of the project, "called 'MD5 Birthdaying,'
consists of finding a block with very specific properties, that will help us
in later phases. Finding that block on a single Pentium4 3Ghz would take
approx. 800 days of 24/7 continous running." In the future the project
also plans to work on collision-finding for SHA-1.
The project found its first collision on March 10, 2006. On July 1, 2006, the project stopped its birthday search to continue with stage 2: completing a partial collision to a full MD5 collision. On September 12, 2006, the project started using its new application for stage 2 work. It eliminated all 8 bitdifferences for stage 2 as of October 12, 2006. The project published its MD5 collision results on October 24, 2006: Colliding X.509 Certificates for Different Identities. The project uses a BOINC-based client. See the BOINC platform information for the latest version of the BOINC client. The project runs the "MD5 Different IV Attack - stage 2" application within BOINC. Version 1.14 of the application is available for Windows and Linux as of September 18, 2006. Join a discussion forum about this project. |
5,845,364 credits; 120 collisions found: 120 80 useful collisions found: 80 Lowest amount of bitdifferences: 8 8 (of 8) bitdifferences eliminated |
|
|
Free Rainbow Tables
is generating Rainbow Tables to use for breaking hashes.
The project's software client is based on Zhu Shuanglei's
Project Rainbow Crack.
Results from the project are compiled into complete
tables, which are
then submitted to
freerainbowtables.com where
they are available for free to anyone.
To participate in the project, download the DistrRTgen software client from the project website and run it. Free registration is required (only a username and password, no other information is collected). Version 3.0 of the GUI client is available for Windows currently. Note that you need to have Microsoft .NET Framework 2.0 installed to run the Windows client. Join a discussion forum |
ongoing; 14483 cracked hashes; 16831 uncracked hashes |
  |
|
|
SHA-1 Collision Search Graz
is attempting to find collisions for the SHA-1
encryption algorithm, a popular algorithm which is used in many
software applications such as email and secure web browsing." SHA-1
is a hashing algorithm which produces a string of letters and numbers
(a "fingerprint") for a given text input. The project implements a
dedicated attack, which "tries to exploit the inner working of the hash
function" to find two different inputs which generate the same
fingerprint. See
about the project.
The project uses a BOINC-based client. See the BOINC platform information for the latest version of the BOINC client. The project runs the "SHA-1 Collision Search Graz" application within BOINC. Version 5.27 of the application is available for Windows and Linux as of August 8, 2007. Join a discussion forum about this project. |
101,136,117 credits |
|
|
|
Enigma@Home is
a BOINC-based wrapper for the
M4 message breaking project.
The project uses a BOINC-based client. See the BOINC platform information for the latest version of the BOINC client. Version 5.17 of the project's Enigma 0.76 application is available for Windows as of September 11, 2007. Version 5.20 of the application is available for Linux as of September 25, 2007. Join a discussion forum about this project. |
credits |
|
|
| The following icons may appear in the Supported Platforms section of the table: | |||||||||||||
|
| Top... |
