30-09-2007

73573 work units processed. On my reference machine (Athlon TB 1400) it would take 18,5 years.
57964 (78.78%) unique results, 15609 duplicates*

Average number of restarts/enigma setting: 6.3

Work unit distribution table snapshot: http://tjm.boo.pl/enigma/results/wu_dist_30_09_2007.htm (900kB html) - as you can see, it's far from equal. This has been partially fixed already.
First column on the left - work unit enigma settings, second column - number of work units processed/number of work units in database.

If you want to see all results, sorted by score, here is database dump: http://tjm.boo.pl/enigma/results/results_30_09_2007.zip - 2,5MB zip archive, about 6MB unpacked (TXT file).

* - that's the way how hillclimbing algorithm works, sometimes it finds same results (max score) with different random starting position.

---

M4 Project homepage
M4 Project wiki

30-09-2007

73573 work units processed. On my reference machine (Athlon TB 1400) it would take 18,5 years.
57964 (78.78%) unique results, 15609 duplicates*

Average number of restarts/enigma setting: 6.3

Work unit distribution table snapshot: http://tjm.boo.pl/enigma/results/wu_dist_30_09_2007.htm (900kB html) - as you can see, it's far from equal. This has been partially fixed already.
First column on the left - work unit enigma settings, second column - number of work units processed/number of work units in database.

If you want to see all results, sorted by score, here is database dump: http://tjm.boo.pl/enigma/results/results_30_09_2007.zip - 2,5MB zip archive, about 6MB unpacked (TXT file).

* - that's the way how hillclimbing algorithm works, sometimes it finds same results (max score) with different random starting position.

What do you mean by "Average number of restarts/enigma setting"?

---

Each work unit has a range of enigma settings (13 right ring setting and 26^4 start positions). A 'restart' is a single walk through all these settings.

---

M4 Project homepage
M4 Project wiki

07-10-2007

110715 work units processed, with a total CPU time equivalent to 27.1 years of my Athon TB.
24884 work units / 8.6 years of CPU time last week.
85831 (77.52%) unique results, 24884 duplicates

Average number of restarts/enigma setting (number of walks thru enigma keyspace): 9.5

Work unit distribution table snapshot: http://tjm.boo.pl/enigma/results/wu_dist_07_10_2007.htm (600kB html)

Results database dump: http://tjm.boo.pl/enigma/results/results_07_10_2007.zip - 3,8MB zip archive, about 9,7MB unpacked (TXT file).

---

M4 Project homepage
M4 Project wiki

14-10-2007

143266 work units processed, with a total CPU time equivalent to 33.7 years of my Athon TB.
32551 work units / 6.6 years of CPU time last week.
110143 (77.42%) unique results, 32123 duplicates

Number of walks thru enigma keyspace): 12.2

Work unit distribution table snapshot: http://tjm.boo.pl/enigma/results/wu_dist_14_10_2007.htm (600kB html)

Results database dump: http://tjm.boo.pl/enigma/results/results_14_10_2007.zip - 4,8MB zip archive, about 12,1MB unpacked (TXT file).

---

M4 Project homepage
M4 Project wiki

Hi TJM,

Can you track the host and/or user that has the highest score ?
if tracked can you display it somewhere ?

Even better would be that each user can check his own highest scores achieved

I am new to this project and may be i have missed some information but this tracking could be a very good incentive for this project ;)

---

Celtar wrote:

Can you track the host and/or user that has the highest score ?

Yes I can, but it has to be done manually, because assimilated results are moved to a separate (offline) database.

Celtar wrote:

if tracked can you display it somewhere ?

I can post it here on forums, everytime when highest score changes.

Celtar wrote:

Even better would be that each user can check his own highest scores achieved

That's impossible, because work units are removed from BOINC database after two weeks, and the main database is too large to do realtime queries.



Score: 1880400  Settings: B:PX:OGDO:B723:AYBLCJDHEPFGISKNQRVX
shsnquleistehroaryxbeiefueneiffenseaiqkjrnenulmgkebeininefuermschtzeluhy

was found by UBT - Timbo

http://www.enigmaathome.net/workunit.php?wuid=117384
http://www.enigmaathome.net/result.php?resultid=122026
http://www.enigmaathome.net/show_host_detail.php?hostid=1569

---

M4 Project homepage
M4 Project wiki

Thanks

---

21-10-2007

171470 work units processed, with a total CPU time equivalent to 40.6 years of my Athon TB.
28204 work units / 6.9 years of CPU time last week.
131505 (76.69%) unique results, 39965 duplicates

14.7 walks through enigma keyspace

Work unit distribution table snapshot: http://tjm.boo.pl/enigma/results/wu_dist_21_10_2007.htm (600kB html)

Results database dump: http://tjm.boo.pl/enigma/results/results_21_10_2007.zip - 5,9MB zip archive, about 14,1MB unpacked (TXT file).

---

M4 Project homepage
M4 Project wiki

28-10-2007

210098 work units processed, with a total CPU time equivalent to 49.6 years of my Athon TB.
38628 work units / 9 years of CPU time last week.
157788 (75,1%) unique results, 52310 duplicates

18 walks through enigma keyspace

Work unit distribution table snapshot: http://tjm.boo.pl/enigma/results/wu_dist_28_10_2007.htm (600kB html)

Results database dump: http://tjm.boo.pl/enigma/results/results_28_10_2007.zip - 7,4MB zip archive, about 18,2MB unpacked (TXT file).

Posted with a 2 days delay, because due to unfinished database upgrade I couldn't extract results.

---

M4 Project homepage
M4 Project wiki

Current highest score

Score: 1883763 Settings: B:GI:XMXF:B256:AUBXCMERFGIQJKNYOTPWVZ
effenyodendetersixssfruenrdursersumnenxannuenioiiningrneunebeuenkuleplnu

was found by Eliot Meadow
http://www.enigmaathome.net/show_user.php?userid=344
http://www.enigmaathome.net/show_host_detail.php?hostid=504
http://www.enigmaathome.net/workunit.php?wuid=389621
http://www.enigmaathome.net/result.php?resultid=415737

---

M4 Project homepage
M4 Project wiki

Any chance for an update. I'm curious what kind of progress is being made :)

Any chance for an update. I'm curious what kind of progress is being made :)

Progress info is now automatically updated in realtime http://www.enigmaathome.net/server_status.php (and that's why it takes around 10s to load server status when it's not cached - queries to the master db which keeps all results are slow). So far we did almost 60 walks through enigma keyspace, close to 690k hceyz72 workunits were processed at average rate around 5700/day (current rate close to 11k/day).

A quote from m4 mailing lists:

Stefan Krah wrote:

The problem we are facing is this:

There exist 100 letter messages that consistently require > 300 restarts
to be broken. Thus, in order to say with confidence that the message we
are dealing with cannot be broken, we should give it 300 restarts.

The first part has had something like 23 restarts, the second 60.

The BOINC clients are working on a 72 letter version of the message
so we have some variation.


Stefan Krah

---

M4 Project homepage
M4 Project wiki

So if project runs for 300 walks (which I assume based on the number of WUs that it's currently set for 500 walks) and we do one walk around every 9-10 days and we've done 60 walks.

240 x 10 = 2,400 days = 80 months.


Looks like I need to assimilate a few more machines!

Any remote idea how close we can be to finding the result? I'm highly motivated by being close :) I know it can be random, but for example, how many combinations are left to test? "Result can be found in anywhere from 1 day to [???]".

When HashClash said they had a only few thousand workunits more and they would get the colliding hashes, I crunched it 24/7 on my two machines until they were done, *and* tried to get more people crunching it. They finished in a few days.

---

The search space is quite large, we are at 65/500, and it's impossible to tell when (or if) the message will be broken.

---

M4 Project homepage
M4 Project wiki

So if project runs for 300 walks (which I assume based on the number of WUs that it's currently set for 500 walks) and we do one walk around every 9-10 days and we've done 60 walks.

240 x 10 = 2,400 days = 80 months.


Looks like I need to assimilate a few more machines!

That's not true, recently the rate was close to 1.2-1.5 full walks/day, but it depends on the workunits length - server sends them in semi-random order (wu's with the lowest numbers of restarts first), so if there's a large number of type 2 and 3 workunits (the longest ones) in progress, overall rate will drop significantly.

---

M4 Project homepage
M4 Project wiki

I'd like to try attacking this from a different angle if possible. I think alot of users might like attacking it with something different. Maybe a slightly different dictionary, message length or part of message, or something.
How hard would it be to allow guessing words. Practically all the original enigma machines were cracked that way.

I'd like to try attacking this from a different angle if possible. I think alot of users might like attacking it with something different. Maybe a slightly different dictionary, message length or part of message, or something.
How hard would it be to allow guessing words. Practically all the original enigma machines were cracked that way.

Guessing words: how is this supposed to be done without human involvement?
Remember, Enigma was a machine to create polyalphabetic cipher texts.
From http://en.wikipedia.org/wiki/Rotor_cipher_machine:

Not until the 1840s (Babbage) was any technique known which could reliably break any of the polyalphabetic ciphers. His technique also looked for repeating patterns in the ciphertext, which provide clues about the length of the key. Once this is known, the message essentially becomes a series of messages, each as long as the length of the key, to which normal frequency analysis can be applied. Charles Babbage, Friedrich Kasiski, and William F. Friedman are among those who did most to develop these techniques.

So, what would this say about chopping up an un-deciphered code into something of shorter length? My instinct is to say this would completely throw things off.

Cipher designers tried to get users to use a different substitution for every letter, but this usually meant a very long key, which was a problem in several ways. A long key takes longer to convey (securely) to the parties who need it, and so mistakes are more likely in key distribution. Also, many users do not have the patience to carry out lengthy, letter perfect evolutions, and certainly not under time pressure or battlefield stress. The 'ultimate' cipher of this type would be one in which such a 'long' key could be generated from a simple pattern (ideally automatically), producing a cipher in which there are so many substitution alphabets that frequency counting and statistical attacks would be effectively impossible. Enigma, and the rotor machines generally, were just what was needed since they were seriously polyalphabetic, using a different substitution alphabet for each letter of plaintext, and automatic, requiring no extraordinary abilities from their users. Their messages were, generally, much harder to break than any previous ciphers.

Well, I was thinking of it involving minimal human effort. Just trying the top 20 words in similar enigma messages maybe.
Maybe different lengths wouldn't work, but I don't see why trying cribs would hurt. I don't think it would take very long to try the top cribs.
Just a thought.