Al Piskun: add stats

2026-07-15T20:58:06Z

add stats

← Older revision		Revision as of 20:58, 15 July 2026
Line 14:		Line 14:
	\| released = {{Start date and age\|2006\|01\|09}}		\| released = {{Start date and age\|2006\|01\|09}}
	\| completed = Yes		\| completed = Yes
	\| discontinued = ~~Yes~~		\| discontinued =
	\| repository = {{URL\|https://github.com/jbo-85/enigma-suite}}		\| repository = {{URL\|https://github.com/jbo-85/enigma-suite}}
	\| programming language = C, Python		\| programming language = C, Python
	\| operating system = Windows, Linux, macOS, Android		\| operating system = Windows, Linux, macOS, Android

			\| stats as of = {{Start date and age\|2019\|07\|17}}
			\| average performance = 20079.27 GigaFLOPS
			\| active users = 302
			\| total users = 69398
			\| active hosts = 938
			\| total hosts = 152157

	\| website = {{URL\|http://www.enigmaathome.net/}}		\| website = {{URL\|http://www.enigmaathome.net/}}
	\| license = GPL-2.0		\| license = GPL-2.0

Al Piskun: add wayback link

2026-07-15T20:36:46Z

add wayback link

← Older revision		Revision as of 20:36, 15 July 2026
Line 22:		Line 22:
	}}		}}

	'''Enigma@Home''' was a [[BOINC]] volunteer computing project that attacked genuine, unsolved [[wikipedia:Enigma-M4\|Enigma M4]] cipher messages from the Second World War using a combination of brute force search and hill climbing cryptanalysis. The project was a BOINC "wrapper" around Stefan Krah's '''M4 Project''' (also called the '''M4 Message Breaking Project'''), which was launched independently in January 2006 before being ported to the BOINC platform to draw on a much larger pool of volunteered computer time.<ref name="bytereef-m4">{{Cite web \|title=M4 Message Breaking Project \|url=https://www.bytereef.org/m4_project.html \|website=bytereef.org \|authors=Stefan Krah \|accessdate=2026-07-15}}</ref><ref name="networkworld">{{Cite web \|title=Still trying to crack Nazi Enigma messages \|url=https://www.networkworld.com/article/2247101/still-trying-to-crack-nazi-enigma-messages.html \|website=Network World \|date=2009-08-31 \|accessdate=2026-07-15}}</ref> Over the project's lifetime, volunteers helped recover the plaintext of several authentic [[wikipedia:Kriegsmarine\|Kriegsmarine]] radio messages that had defeated Allied codebreakers at [[wikipedia:Bletchley Park\|Bletchley Park]] during the war and had remained unbroken ever since.		'''[https://web.archive.org/web/20190401042546/http://www.enigmaathome.net/ Enigma@Home]''' was a [[BOINC]] volunteer computing project that attacked genuine, unsolved [[wikipedia:Enigma-M4\|Enigma M4]] cipher messages from the Second World War using a combination of brute force search and hill climbing cryptanalysis. The project was a BOINC "wrapper" around Stefan Krah's '''M4 Project''' (also called the '''M4 Message Breaking Project'''), which was launched independently in January 2006 before being ported to the BOINC platform to draw on a much larger pool of volunteered computer time.<ref name="bytereef-m4">{{Cite web \|title=M4 Message Breaking Project \|url=https://www.bytereef.org/m4_project.html \|website=bytereef.org \|authors=Stefan Krah \|accessdate=2026-07-15}}</ref><ref name="networkworld">{{Cite web \|title=Still trying to crack Nazi Enigma messages \|url=https://www.networkworld.com/article/2247101/still-trying-to-crack-nazi-enigma-messages.html \|website=Network World \|date=2009-08-31 \|accessdate=2026-07-15}}</ref> Over the project's lifetime, volunteers helped recover the plaintext of several authentic [[wikipedia:Kriegsmarine\|Kriegsmarine]] radio messages that had defeated Allied codebreakers at [[wikipedia:Bletchley Park\|Bletchley Park]] during the war and had remained unbroken ever since.

	==History==		==History==

Al Piskun: first light

2026-07-15T20:33:49Z

first light

New page

{{Infobox software
| name = Enigma@Home
| screenshot = Four_Rotor_Enigma_Museum_fur_Kommunikation_Frankfurt.JPG
| caption = A four rotor Kriegsmarine Enigma M4, the machine type whose original wartime radio traffic Enigma@Home tried to decipher
| description = Enigma@Home was a completed Mathematics and Cryptography BOINC project that used distributed hill climbing cryptanalysis to break original, previously unsolved German Kriegsmarine Enigma M4 radio messages from the Second World War, based on Stefan Krah's M4 Project.
| status = Completed
| category = Mathematics, Cryptography
| compute = CPU & GPU
| dependencies = None for the CPU client; the GPU application required CUDA or OpenCL drivers
| developer = Stefan Krah
| author = Stefan Krah
| sponsor = None (independent volunteer effort)
| maintainer = Inactive
| released = {{Start date and age|2006|01|09}}
| completed = Yes
| discontinued = Yes
| repository = {{URL|https://github.com/jbo-85/enigma-suite}}
| programming language = C, Python
| operating system = Windows, Linux, macOS, Android
| website = {{URL|http://www.enigmaathome.net/}}
| license = GPL-2.0
}}

'''Enigma@Home''' was a [[BOINC]] volunteer computing project that attacked genuine, unsolved [[wikipedia:Enigma-M4|Enigma M4]] cipher messages from the Second World War using a combination of brute force search and hill climbing cryptanalysis. The project was a BOINC "wrapper" around Stefan Krah's '''M4 Project''' (also called the '''M4 Message Breaking Project'''), which was launched independently in January 2006 before being ported to the BOINC platform to draw on a much larger pool of volunteered computer time.<ref name="bytereef-m4">{{Cite web |title=M4 Message Breaking Project |url=https://www.bytereef.org/m4_project.html |website=bytereef.org |authors=Stefan Krah |accessdate=2026-07-15}}</ref><ref name="networkworld">{{Cite web |title=Still trying to crack Nazi Enigma messages |url=https://www.networkworld.com/article/2247101/still-trying-to-crack-nazi-enigma-messages.html |website=Network World |date=2009-08-31 |accessdate=2026-07-15}}</ref> Over the project's lifetime, volunteers helped recover the plaintext of several authentic [[wikipedia:Kriegsmarine|Kriegsmarine]] radio messages that had defeated Allied codebreakers at [[wikipedia:Bletchley Park|Bletchley Park]] during the war and had remained unbroken ever since.

==History==

===Origins: the M4 Project===
The three original ciphertexts targeted by the project were intercepted by the British destroyer [[wikipedia:HMS Hurricane (H06)|HMS ''Hurricane'']] in the North Atlantic on 25 November 1942, during the ten month period the British called the "black-out", when Bletchley Park's Naval Enigma section could not read Kriegsmarine traffic enciphered with the newly introduced four rotor Enigma M4.<ref name="wp-enigmam4">{{Cite web |title=Enigma-M4 |url=https://en.wikipedia.org/wiki/Enigma-M4 |website=Wikipedia |accessdate=2026-07-15}}</ref> The intercepts were published by historian Ralph Erskine in a 1996 letter to the journal ''[[wikipedia:Cryptologia|Cryptologia]]'' and were widely assumed to be permanently unbreakable, since a ciphertext-only attack on the M4 has to search a key space of roughly

<math>N = 1344 \times 676 \times 439{,}400 \times 150{,}738{,}274{,}937{,}250 \approx 6.02 \times 10^{25}</math>

possible machine settings, a figure corresponding to a key length of almost 86 bits once the choice of rotors, ring settings, rotor start positions, and plugboard wiring are all combined.<ref name="wp-enigmam4" /> The project was catalogued on the official BOINC project wiki under the "Mathematics and Games Projects" category.<ref name="berkeleywiki">{{Cite web |title=Enigma@Home |url=https://boinc.berkeley.edu/wiki/Enigma@Home |website=BOINC official wiki |publisher=University of California, Berkeley |accessdate=2026-07-15}}</ref>

In January 2006, [[wikipedia:Stefan Krah|Stefan Krah]], a German-born violinist and cryptography hobbyist, wrote a message-breaking program and began recruiting volunteers on internet newsgroups, attracting around 45 participants in the project's first weeks.<ref name="bbc2006">{{Cite web |title=Online amateurs crack Enigma codes |url=http://news.bbc.co.uk/2/hi/technology/4763854.stm |website=BBC News |date=2006-03-01 |accessdate=2026-07-15}}</ref><ref name="networkworld" /> Krah named the effort the M4 Project, after the four rotor machine.<ref name="bbc2006" /> Rather than attempting the full plugboard search, the client software brute forced only the rotor choice, ring settings, and rotor start positions, a much smaller space of

<math>N_{\text{search}} = 1344 \times 676 \times 439{,}400 \approx 3.99 \times 10^{11}</math>

candidate settings, and used a hill climbing algorithm to recover the plugboard wiring for each candidate, scoring decrypted candidate plaintext against [[wikipedia:Sinkov statistics|Sinkov statistics]] of German language text.<ref name="bytereef-m4" />

===Breaking the Erskine messages===
The first of the three 1942 messages was broken on 20 February 2006, only about six weeks after the project began. It proved to be a routine contact report sent by [[wikipedia:Hartwig Looks|Hartwig Looks]], commander of the [[wikipedia:German submarine U-264|German submarine U-264]], describing a depth charge attack and giving the U-boat's position, course, speed, and local weather.<ref name="hoerenberg-m4">{{Cite web |title=The M4 message breaking project |url=https://enigma.hoerenberg.com/index.php?cat=M4+Project+2006 |website=ENIGMA M4 |authors=Michael Hoerenberg |accessdate=2026-07-15}}</ref><ref name="wp-enigmam4" /> A second message from the same batch was broken on 7 March 2006.<ref name="hoerenberg-m4" /> The third message resisted brute-force hill climbing for several more years; it is believed to have been partly enciphered as an "Offizier" message, meaning it was doubly encrypted with an additional, officer-only substitution before being enciphered a second time on the M4 itself, which defeats a straightforward attack.<ref name="networkworld" /> It was finally solved on 14 January 2013, not through raw distributed brute force but after cryptanalyst Daniel J. Girard and Michael Hörenberg, working independently of the BOINC client, located a usable crib during a joint search of U-boat war diaries; the crib let Girard's own bombe-simulator and hillclimbing software recover the plaintext directly.<ref name="hoerenberg-m4" /><ref name="girard2016">{{Cite journal |title=Breaking "Tirpitz": Cryptanalysis of the Japanese-German joint naval cipher |authors=Daniel J. Girard |journal=Cryptologia |volume=40 |issue=5 |pages=428–451 |year=2016 |doi=10.1080/01611194.2015.1087073}}</ref>

===The Norrköping messages===
After the original three Erskine messages had all been solved, researchers located a further cache of Enigma intercepts made by the Swedish security police at [[wikipedia:Norrköping|Norrköping]] between December 1939 and April 1940, comprising more than twenty additional naval intercepts along with a handful of Army and Luftwaffe messages.<ref name="norrkoping">{{Cite web |title=The Norrköping Enigma messages |url=https://enigma.hoerenberg.com/index.php?cat=Norrk%C3%B6ping+messages |website=ENIGMA M4 |authors=Dan Girard |accessdate=2026-07-15}}</ref> Enigma@Home's BOINC infrastructure turned its distributed computing power to this archive, breaking a message referred to on the project's forums as "FNYG MXHU" in June 2013, and, following a further burst of activity after new intercepts surfaced in mid-2017, the messages code-named "KLDIO" on 2 August 2017 and "FTNBK" on 15 September 2017.<ref name="fnyg-mxhu">{{Cite web |title=Enigma@Home - FNYG MXHU message broken |url=https://boinc.berkeley.edu/forum_thread.php?id=8464 |website=BOINC Message Boards |date=2013-06 |accessdate=2026-07-15}}</ref><ref name="kldio-broken">{{Cite web |title=KLDIO broken |url=http://www.enigmaathome.net/forum_thread.php?id=1101 |website=Enigma@Home Message Boards |date=2017-08-02 |accessdate=2026-07-15}}</ref><ref name="ftnbk-broken">{{Cite web |title=FTNBK broken |url=http://www.enigmaathome.net/ |website=Enigma@Home News |date=2017-09-15 |accessdate=2026-07-15}}</ref> Around the same period the project added a [[Gridcoin]]-compatible GPU application, encouraging cryptocurrency mining teams to contribute additional compute power, and released CUDA and OpenCL builds capable of running on graphics cards from the Fermi generation onward.<ref name="bc-team">{{Cite web |title=Enigma@home |url=https://www.bc-team.org/viewtopic.php?t=313 |website=BOINC Confederation Forums |accessdate=2026-07-15}}</ref><ref name="ve3nea-cuda">{{Cite web |title=enigma-cuda |url=https://github.com/VE3NEA/enigma-cuda |website=GitHub |accessdate=2026-07-15}}</ref>

The improved hill climbing and partial plugboard exhaustion techniques developed and tested during this later phase of the project were subsequently documented in the peer-reviewed literature by Olaf Ostwald and Frode Weierud.<ref name="ostwald2017">{{Cite journal |title=Modern breaking of Enigma ciphertexts |authors=Olaf Ostwald, Frode Weierud |journal=Cryptologia |volume=41 |issue=5 |pages=395–421 |year=2017 |doi=10.1080/01611194.2016.1238423}}</ref>

==Cryptanalytic method==
[[File:Enigma-rotor-windows.jpg|thumb|Close-up of the rotor windows of a four rotor Naval Enigma, the component whose settings formed the bulk of the search space attacked by the project's client software]]
Enigma@Home's client combined two complementary techniques rather than a single brute force pass over the entire M4 key space:

* '''Exhaustive search''' of the rotor order, ring settings, and rotor starting positions, since these form a comparatively small, enumerable space of roughly 4 × 10<sup>11</sup> combinations once the plugboard is set aside.<ref name="bytereef-m4" />
* '''Hill climbing''' over the plugboard wiring for each candidate machine setting: starting from an empty or partially filled plugboard, the algorithm repeatedly tried swapping plug connections, scored the resulting candidate plaintext against expected German letter and bigram statistics, and kept only changes that improved the score, iterating until no further improvement could be found.<ref name="bytereef-m4" />

The key server distributed work in fixed-size batches of 26<sup>4</sup> keys; on a single Celeron processor of the era a batch took roughly 80 minutes to process, and the entire search space for one message comprised several thousand such batches.<ref name="bytereef-m4" /> Later versions of the client also implemented a "partial exhaustion" refinement of the plugboard search, described by Ostwald and Weierud, which combined limited brute forcing of a few plug pairs with hill climbing over the remainder, improving success rates on short or heavily garbled ciphertexts.<ref name="ostwald2017" />

==Software and technical details==
[[File:M4_Enigma_machine,_1_of_2,_U-505_-_Museum_of_Science_and_Industry_(Chicago)_-_DSC06773.JPG|thumb|right|A surviving Enigma M4, of the type captured intact from German submarine U-505 in 1944]]
The cryptanalytic core of the client, ''enigma-suite'', was written in [[C (programming language)|C]] by Stefan Krah and released under the [[GNU General Public License|GNU General Public License, version 2]].<ref name="enigma-suite">{{Cite web |title=enigma-suite |url=https://www.bytereef.org/enigma-suite.html |website=bytereef.org |authors=Stefan Krah |accessdate=2026-07-15}}</ref> The BOINC wrapper and scheduling logic around it were written in [[Python (programming language)|Python]].<ref name="bytereef-m4" /> The BOINC-hosted version supported Windows, Linux, macOS, and Android clients, distributing work through a conventional BOINC scheduler and awarding credit for completed workunits.<ref name="mundaywiki">{{Cite web |title=Enigma@Home |url=https://boinc.mundayweb.com/wiki/index.php?title=Enigma@Home |website=BOINC Wiki (Mundayweb) |accessdate=2026-07-15}}</ref> A CUDA-accelerated GPU application, based on the enigma-suite algorithm with additional optimizations, was later made available for GPUs of Nvidia Fermi compute capability (2.0) or newer, and an OpenCL build offered comparable support for AMD graphics cards.<ref name="bc-team" /><ref name="ve3nea-cuda" /> Because the underlying source code was published under the GPL, independent forks and optimized builds of the client circulated within the BOINC community throughout the project's active years.<ref name="enigma-suite" />

==Publications==
The following papers are listed for Enigma@Home on the official [[wikipedia:BOINC|BOINC]] publications page.<ref name="pubsphp">{{Cite web |title=Publications by BOINC Projects |url=https://boinc.berkeley.edu/pubs.php |website=BOINC |publisher=University of California, Berkeley |accessdate=2026-07-15}}</ref>

# Girard, Daniel J. [https://doi.org/10.1080/01611194.2015.1087073 Breaking "Tirpitz": Cryptanalysis of the Japanese-German joint naval cipher]. ''Cryptologia'' (2016). This paper gives the solutions of the only four surviving messages from the previously unbroken Japanese-German joint naval cipher known as "Tirpitz", which used a specially built model T Enigma; the article's author biography credits its methods, and the earlier break of the third Erskine message, to techniques and collaborations that grew out of the M4 Project and Enigma@Home cryptanalytic community.<ref name="girard2016" />
# Campbell, MacGregor. [https://www.sciencedirect.com/science/article/pii/S0262407911612025 Uncrackable codes: The second world war's last Enigma]. ''New Scientist'' (2011). A general-audience feature on the still-unsolved third Erskine message and the crowdsourced Enigma@Home effort to recover it, published two years before that message was finally broken.<ref name="campbell2011">{{Cite journal |title=Uncrackable codes: The second world war's last Enigma |authors=MacGregor Campbell |journal=New Scientist |volume=211 |issue=2822 |year=2011 |doi=10.1016/S0262-4079(11)61202-5}}</ref>

==See also==
* [[BOINC]]
* [[HashClash]]
* [[NumberFields@Home]]
* [[wikipedia:Enigma machine|Enigma machine]]
* [[wikipedia:Cryptanalysis of the Enigma|Cryptanalysis of the Enigma]]

==References==
{{Reflist}}

[[Category:Completed projects]]
[[Category:Mathematics projects]]
[[Category:Cryptography projects]]

Enigma@Home - Revision history

Al Piskun: add stats

Al Piskun: add wayback link

Al Piskun: first light