Enigma@Home
Enigma@Home is a BOINC volunteer computing project that attacked genuine, unsolved Enigma cipher messages from the Second World War with a combination of exhaustive key search and hill climbing cryptanalysis. The project was a thin BOINC "wrapper" around Stefan Krah's M4 Project (also called the M4 Message Breaking Project), a standalone distributed effort he began on 9 January 2006. Its BOINC applications were built on Krah's open source enigma-suite software, with the project itself supplying a scheduler, work generator and credit system around it.[1][2][3]
Over the project's lifetime volunteers recovered the plaintext of at least four genuine wartime messages that had gone unread since 1945: the German Army message KEJNQ in 2010, the U-boat message FNYG MXHU in 2013, and the Army messages KLDIO and FTNBK in 2017.[1][4] A further set of short 1941 Army messages plus the U-boat message known as VROL NMKA (archive number P1030680) were still outstanding when the project's public work stopped in 2017.[5][6]
After several quiet years the project administrator, posting as TJM, confirmed in October 2026 that the project was being reviewed and rebuilt with heavy use of artificial intelligence, and that small batches of test tasks were still being generated and crunched.[7]
History
Origins: the M4 Project
The three ciphertexts at the heart of the original project came from a Royal Navy high frequency direction finding report, dated 25 November 1942, which had been appended to a report by the commanding officer of the destroyer HMS Hurricane on the completion of her escort of convoy HX 215. The operator had intercepted three naval signals on 19 and 21 November 1942, in the middle of the ten month period the British called the "black-out", when Bletchley Park could not read Kriegsmarine traffic enciphered on the newly introduced four rotor Enigma M4.[8][9] The cryptanalyst and historian Ralph Erskine transcribed the intercepts in a letter written in 1995 and published in the October 1996 issue of Cryptologia, presenting them as a standing challenge.[8][10]
A ciphertext only attack on the M4 has to contend with the full key space of the machine. Writing the plugboard as an exact combinatorial term and multiplying by the rotor choices, ring settings and rotor start positions gives
which is equivalent to a key length of about bits, and that figure is what made the messages look permanently unbreakable.[9][11]
Krah, a German born violinist with an interest in cryptography and open source software, wrote a message breaking program and announced the effort in two Usenet newsgroups and on one mailing list. About 45 volunteers joined in the first weeks, and by early March 2006 the project had grown to roughly 2,500 contributing machines.[12] He named it the M4 Project after the four rotor machine.[12]
Moving onto BOINC
Enigma@Home appeared on the BOINC platform in 2007. The project site posted its first "Hello World" item on 24 August 2007, an alpha test restricted to Windows began on 9 September 2007, an experimental Linux build arrived on 18 September 2007, and Lars Bausch compiled both the enigma application and the BOINC wrapper for Mac OS X on Intel and PowerPC hardware in December 2007.[1] The official BOINC project wiki, which listed Enigma@Home under "Mathematics and Games Projects", recorded an official launch date of 09-09-2007.[13] The project moved to its long term address, enigmaathome.net, on 14 October 2007.[1] Krah described the arrangement in 2009 in straightforward terms: "The BOINC wrapper is very successful. In fact most people prefer the BOINC client and the majority of work units is now submitted via BOINC."[14]
Breaking the Erskine messages
The first break was logged by the M4 Project server on 20 February 2006 at 11:02, little more than six weeks after the project began, and it recovered the message sent by Kapitänleutnant Hartwig Looks of U-264. The recovered settings were reflector B, wheels B241, ring settings AAAV, message key VJNA and plugboard AT BL DF GJ HM NW OP QY RZ VX.[15] It turned out to be a routine contact report: forced to dive during a depth charge attack, last enemy position at 08:30 in naval grid square AJ 9863, course 220 degrees, speed 8 knots, barometer 1014 millibars falling, wind north north east force 4, visibility 10 nautical miles.[15] The second message yielded on 7 March 2006.[2]
The third message was a much harder proposition. Krah suggested in 2009 that it might be a so called Offizier message, in which part of the text is enciphered a second time under an officer only procedure, that it might have been badly intercepted with letters missing, or simply that it required the hill climbing algorithm to be run an unusually large number of times.[14] It eventually fell to Daniel J. Girard, working with Michael Hörenberg, who combined a Turing Bombe simulator with a hillclimber: the Bombe took a crib and looked for wheel settings where the ciphertext would decipher to it, and the hillclimber then extended each "stop" to the rest of the message.[10] The project announced the break on 13 February 2013, noting that this was the last of the messages from Erskine's letter.[1] The message was a fuel and supply signal from Kapitänleutnant Herrmann Rasch of U-106, arranging a rendezvous with the tanker boat U-460 for about 27 November, requesting binoculars, and reporting the boat's naval square and the weather.[8]
Girard's own post break analysis is a useful corrective to the idea that sheer CPU power did the job. Testing a stand-alone hillclimber against a perfect re-encipherment of the Rasch plaintext, he found it succeeded only about of the time even when the wheel order, ring setting and message key were already known, and it failed outright on the first attempt for every version of the ciphertext.[10]
German Army messages
Once the M4 server ran dry, the BOINC project branched out. A news item of 16 November 2009 explained that the "awgly" keyspace was finished and that the administrator intended to run one of the other known unbroken messages.[1] That work paid off on 6 May 2010, when Nuller[NDS] of Russia Team returned settings that deciphered the first 102 letters of the 153 letter message KEJNQ, the remaining letters being left to later passes.[1][16] BOINC's own news feed reported the result on 11 May 2010 as the decryption of "one of 22 previously unbroken German Army messages".[4] These were the messages Geoff Sullivan and Frode Weierud had published, with only a handful still unread, in their 2005 Cryptologia paper "Breaking German Army Ciphers".[17]
Four quiet years followed, then a burst of GPU driven activity. Test versions of an Nvidia CUDA application appeared on 26 June 2017, version 1.07 extended support to Fermi class cards with compute capability 2.0, and an "Enigma Test" application began trialling OpenCL and Linux CUDA builds on 12 July 2017.[1] The extra throughput showed immediately. On 2 August 2017 the project announced that KLDIO, a 90 letter message of 29 July 1941, had been returned by the participant "Dave GPU" within less than two days of the GPU application becoming available.[1][18] Then on 15 September 2017 came FTNBK, a 101 letter message of 16 July 1941 carrying message number 214.[1][19] One member of Team Gridcoin reckoned that network had supplied just over half of the computation behind the FTNBK break, which had been underwritten by the project's presence on the Gridcoin whitelist.[5]
With FTNBK solved, six targets remained on the board: the Army messages JBIYH, LXACA, ALQFI, RXPBS and MVUEH, and the naval four rotor message VROLN.[5]
The U-534 messages
A separate thread of work concerned U-534, a Type IXC/40 boat sunk by an RAF bomber in the Kattegat on 5 May 1945 and raised in 1993.[20] Her cipher forms survived with the boat, including evidence that her operators used a Schreibmax printer attachment rather than transcribing from lamps.[20] On 18 February 2013 the project restarted its work generator on a new M4 batch built around the message whose indicator groups read VROL NMKA, better known by its archive number P1030680, a 72 letter signal of 1 May 1945 thought to be in the naval key "Thetis", which the boat did not carry.[1][6]
Four months later, on 20 June 2013, the participant ThrasherX-17 of team Keep The Fire Alive! returned the plaintext of the companion message FNYG MXHU, 76 letters long, which read "AN LEITUNG VON U BOOT STUETZPUNKT WILHELMSHAVEN: FUNKTELEGRAMM EINS ZWO ZWO VIER HIER MIT RHV GELOEST", that is, a note to the U-boat command at Wilhelmshaven that radio message 1224 had been solved using the hand cipher system.[1][21] The administrator noted that at 76 letters it was probably the shortest M4 message ever broken by a ciphertext only attack, and that the project had made 48 full walks through the complete M4 key space before the solution appeared.[21] P1030680 itself has never been solved; Hörenberg's page for it still lists the wheels, ring settings and plugs as unknown, and asks that correspondents stop sending unverifiable machine generated "solutions".[6]
Decline
The project's news feed stopped on 15 September 2017 with the announcement of the FTNBK break, and the front page still carried that same item as its most recent news in captures made in 2021 and 2024.[1][22] Participants noticed. A 2019 r/BOINC thread about connection failures attracted the reply that the administrator "was known for disappearing for months at a time", that he had not posted for almost two years, and that the project was "still generating work, so either he's doing things behind the scenes or it's completely running on autopilot".[23] Discussion on r/Gridcoin in the same year noted that work had shifted to the 1941 German Army corpus and that account creation had become invitation only.[24] For several years the site stayed up and continued to hand out work while the administrator remained silent.
2026: overhaul and the AI connection
Enigma@Home never formally closed, and WUProp@Home, a BOINC project that records which applications have returned work in the previous 24 hours, kept showing it in its active list. When that list was checked on 5 November 2026 it still carried the project, with 1,196 workunits returned in the previous day by the "Enigma 0.76b" application and 4,380 by "Enigma Cuda".[25] The question came to a head in the last week of October 2026 in WUProp@Home's long running "News of Projects and Apps Starting and Ending" thread, where a participant noticed 176 hours of Enigma@Home runtime recorded for the administrator's own account in a single day and concluded that "that info makes it seem like it could be back". Asked directly, the administrator, posting as TJM, replied that he could "neither confirm or deny", and then set out what had been happening:[7]
"When used properly, AI makes it significantly easier to implement fixes, ... Improvements to task generation and distribution have also been implemented." TJM, Enigma@Home administrator, WUProp@Home message 12677, 28 October 2026
He added that security vulnerabilities identified by AI were being addressed, that the project must stay "inaccessible from outside" until the fixes and server updates were finished, and that if he finished before others cracked the remaining messages "the project may be reactivated, although not on the same scale as before". Future tasks, he wrote, would "likely be short, making them suitable for less powerful GPUs, and released only in short batches". He also acknowledged the oddity of being the only person earning credit and runtime, explaining that some project statistics are tied directly to BOINC credits and runtime and could not be switched off without distorting them.[7] The project site itself was unreachable when checked on 5 November 2026, consistent with that account.[26]
The wider cryptanalytic community was moving at the same time. On 15 September 2026 Frode Weierud validated a solution of MVUEH, a German Army message of 10 July 1941 that had resisted every attack since 2005 and was one of the six outstanding Enigma@Home targets. The break was produced by an OpenAI GPT-6 Astra agent working under the direction of Carter Leffen, which wrote its own Enigma simulator and Bombe and used the repeated place name ROSENOW as a crib.[27] Michael Hörenberg recorded the event on his news page on 22 September 2026 as the first time an original wartime Enigma message had been broken by AI.[28] Others, including JBIYH, LXACA and RXPSB, were still unbroken in CryptoCellar's September 2026 status list.[29]
Cryptanalytic method

Enigma@Home did two things at once, rather than a single pass over the whole key.[2]
- Exhaustive search over rotor order, ring settings and rotor start positions. Setting the plugboard aside leaves machine settings, and Krah cut this further using the date of the intercepts, which rules out the thin reflector C and the Greek wheel Gamma, plus the expedient of testing only keys with the middle ring in the A position.[2]
- Hill climbing over the plugboard, for each machine setting. Starting from an empty plugboard, the program repeatedly tried new wirings, scored each trial by deciphering the message and comparing the result against the statistics of natural German text, and kept any change that improved the score. The score used Sinkov statistics.[2]
The server handed out work in fixed size batches of keys. With a 180 letter ciphertext a batch took about 80 minutes on a 1.2 GHz Celeron, and the reduced search space for one message came to 7,434 batches, or roughly candidate keys. That works out at about single core days, which is the arithmetic behind Krah's estimate that 100 participants running the software around the clock could sweep the space in four days.[2] Easy messages broke on the first walk, harder ones needed several, and the third Erskine message needed a decade.[2]
Two practical refinements mattered later. Messages could also be attacked in parts: the KEJNQ break reported settings for the first 102 letters of a 153 letter text, leaving the rest for later passes.[16] The scoring dictionaries were upgraded over time, with batch comments distinguishing the original "naval" dictionary set from later, wider dictionaries, and with work generator pauses explained in 2017 as a decision not to keep running a dictionary set that had already failed elsewhere.[1] The first message breaks were also fed back into the community's dictionaries, a debt Hörenberg acknowledged on his own project's news page.[28]
Software

The cryptanalytic core, enigma-suite, was written in C by Stefan Krah and released under version 2 of the GNU General Public License.[3][30] Version 0.76, released on 11 July 2006, shipped three programs: enigma, a command line simulator and message breaking tool supporting the Heer, M3 and M4 models by hill climbing or index of coincidence; enigma-client, the client for the distributed attack; and mkdict, which builds log-ngram dictionaries from sample text.[3] A GitHub mirror created in December 2016 preserves the C sources, including the hill climbing core in hillclimb.c and the scoring routines in score.c.[30] The BOINC side, including the wrapper and scheduling logic, was written in Python.[2]
Participants who preferred their own builds ran the project on BOINC's anonymous platform, with optimised 5.19 and 5.20 applications distributed in 2008.[1] Platform coverage widened over the years: Linux in 2007, Mac OS X on Intel and PowerPC in 2007, armv5tel in 2012, and finally GPUs, with a CUDA application from June 2017 that needed the Visual Studio 2015 C++ redistributable and, from version 1.07, a Fermi class card with compute capability 2.0 or better.[1] An OpenCL build for AMD cards and a Linux CUDA build followed through the "Enigma Test" application, and the project added badges designed by BOINC@Poland members at the end of 2011.[1] A BOINC project directory maintained by Mundayweb records the resulting platform set as Android, Linux, Macintosh and Windows, while noting that the project did not calculate on GPUs.[31]
Scientific publications

Enigma@Home was a small, unfunded, volunteer run project and generated less formal literature than large science projects. The official BOINC publications page, which lists peer reviewed and general audience items arising from BOINC based computing, carries exactly two entries under the project's name.[32] Those, together with the methodological papers the project's author cites as its foundations and the later work that built on the same problems, are collected here.
Listed for the project
- Daniel J. Girard.(2016).Breaking "Tirpitz": Cryptanalysis of the Japanese-German joint naval cipher. Cryptologia. pp. 428-451. DOI: 10.1080/01611194.2015.1087073. The paper gives the solutions of the only four surviving messages of the Japanese-German joint naval cipher code named "Tirpitz", which used a specially built Model T Enigma, and it comes from the same small circle of researchers who finished off the Erskine messages.[32]
- MacGregor Campbell.(2011).Uncrackable codes: The second world war's last Enigma. New Scientist. DOI: 10.1016/S0262-4079(11)61202-5. A general audience feature on the last unbroken Erskine message and the crowdsourced effort to recover it, published two years before Girard and Hörenberg finally solved it.[32]
Method papers the project built on
Krah's own documentation credits two Cryptologia papers as the basis of the client's approach, and both are worth reading by anyone interested in how the work was actually done.
- Jim Gillogly.(1995).Ciphertext-Only Cryptanalysis of Enigma. Cryptologia. pp. 405-413. DOI: 10.1080/0161-119591884060. The reference work on ciphertext only attack by hill climbing and index of coincidence, which Krah names as his introduction to the technique.[2]
- Geoff Sullivan.(2005).Breaking German Army Ciphers. Cryptologia. pp. 193-232. DOI: 10.1080/01611190508951299. Source of the efficient plugboard rewiring used during the hill climb, of several search space shortcuts, and of the very messages that the project attacked after 2009.[2][17]
Later work in the same field
- Olaf Ostwald.(2017).Modern breaking of Enigma ciphertexts. Cryptologia. pp. 395-421. DOI: 10.1080/01611194.2016.1238423. A thorough re-examination of the ciphertext only attack, extending it with a partial exhaustion of the plugboard combined with an optimised hill climbing strategy. The published text does not discuss Enigma@Home, but it is the standard modern statement of the problem the project was working on.
- Ehab Saleh.High-Performance Cryptanalysis: A Comparative Study of Code-Breaking Techniques. 4th International Conference on Innovative Computing and Communication. Retrieved 2026-11-05. A conference review of hardware accelerated and volunteer computing approaches to cryptanalysis, which describes Enigma@Home as the joining of the BOINC framework with Krah's M4 Project and lists it alongside SAT@home and Moo! Wrapper.
Primary accounts and press coverage
The most detailed technical write-up of a break in this field came from the solver rather than a journal. Daniel Girard's 2013 account of the last Erskine intercept sets out his Bombe simulator, his search for cribs in U-boat war diaries, and his post break tests of the hillclimber's success rate.[10] Press coverage of the project includes the BBC's March 2006 report on the first break, Bob Brown's 2009 Network World feature in which Krah discusses the stubborn third message, and the project's own news archive, which remains the best record of what was solved and when.[12][14][1]
Statistics and activity

The statistics snapshot recorded in the infobox, taken on 17 July 2019, shows 69,398 registered participants and 152,157 hosts over the project's lifetime, of which 302 users and 938 hosts were still active, with cumulative throughput of 20,079.27 GigaFLOPS. The project's own front page used a homespun unit, announcing in 2019 that total CPU time was equivalent to 343,762 years, 317 days and 20 hours of an Athlon 3500+ running the stock application.[22]
Activity since then has been intermittent rather than zero, which is what made the 2026 explanation necessary. It is also visible in the runtime figures rather than in finished results: 176 hours of Enigma@Home runtime in one day for a single account corresponds to about cores running continuously, consistent with an eight thread machine.[7] Both applications that WUProp@Home still saw in 2026, "Enigma 0.76b" and "Enigma Cuda", date from the project's active years rather than from the overhaul.[25]
Legacy
Enigma@Home belongs to a small family of BOINC projects that treated historical cryptanalysis as a scientific problem in its own right, alongside HashClash, Moo! Wrapper and Kryptos@Home. Its lasting contribution is less a body of papers than a demonstration: volunteer computing plus a good scoring function could finish problems that had sat open for sixty years, and that a home computer in 2006 could mount the ciphertext only attacks that wartime bombes, which needed a crib, could not attempt at all.[10] The messages it recovered are unglamorous in content and precious as evidence, and the cryptographic software it distributed circulated freely under the GPL long after the project's own lights dimmed.[30]
See also
- BOINC projects
- Kryptos@Home
- HashClash
- Moo! Wrapper
- The Puzzle
- WUProp@Home
- Enigma machine
- Cryptanalysis of the Enigma
- Hartwig Looks
References
- ↑ 1.00 1.01 1.02 1.03 1.04 1.05 1.06 1.07 1.08 1.09 1.10 1.11 1.12 1.13 1.14 1.15 1.16 1.17 Enigma@Home news archive. Enigma@Home. Retrieved 2026-11-05.
- ↑ 2.00 2.01 2.02 2.03 2.04 2.05 2.06 2.07 2.08 2.09 Stefan Krah.M4 Message Breaking Project. bytereef.org. Retrieved 2026-11-05.
- ↑ 3.0 3.1 3.2 Stefan Krah.enigma-suite. bytereef.org. Retrieved 2026-11-05.
- ↑ 4.0 4.1 BOINC news archive: German WW II message cracked by Enigma@home. BOINC. University of California, Berkeley. Retrieved 2026-11-05.
- ↑ 5.0 5.1 5.2 dutch.(2017-10-02).Enigma@Home Cracks Nazi WW2 Enigma Message. Steemit. Retrieved 2026-11-05.
- ↑ 6.0 6.1 6.2 Michael Hörenberg.P1030680: Unbroken Enigma message (U534, 01. May 1945). ENIGMA M4. Retrieved 2026-11-05.
- ↑ 7.0 7.1 7.2 7.3 (2026-10-28).News of Projects and Apps Starting and Ending (message 12677). WUProp@Home message boards. Retrieved 2026-11-05.
- ↑ 8.0 8.1 8.2 Daniel J. Girard.Solution of the last of the "HMS Hurricane" intercepts. ENIGMA M4. Retrieved 2026-11-05.
- ↑ 9.0 9.1 Enigma-M4. Wikipedia. Retrieved 2026-11-05.
- ↑ 10.0 10.1 10.2 10.3 10.4 Daniel J. Girard.Breaking the last "H.M.S. Hurricane" intercept. ENIGMA M4. Retrieved 2026-11-05.
- ↑ Michael Hörenberg.The M4 message breaking project. ENIGMA M4. Retrieved 2026-11-05.
- ↑ 12.0 12.1 12.2 Adam Blenford.(2006-03-02).Online amateurs crack Nazi codes. BBC News. Retrieved 2026-11-05.
- ↑ (2015-09-09).Enigma@Home (archived BOINC wiki page). BOINC wiki. University of California, Berkeley. Retrieved 2026-11-05.
- ↑ 14.0 14.1 14.2 Bob Brown.(2009-08-31).Still trying to crack Nazi Enigma messages. Network World. Retrieved 2026-11-05.
- ↑ 15.0 15.1 Stefan Krah.First break of the M4 Project. bytereef.org. Retrieved 2026-11-05.
- ↑ 16.0 16.1 (2010-05-06).Enigma: KEJNQ gebrochen (forum archive). SETI.Germany. Retrieved 2026-11-05.
- ↑ 17.0 17.1 Geoff Sullivan.(2005).Breaking German Army Ciphers. Cryptologia. pp. 193-232. DOI: 10.1080/01611190508951299.
- ↑ (2017-08-02).Enigma@Home: KLDIO-Nachricht entschlüsselt. SETI.Germany. Retrieved 2026-11-05.
- ↑ Frode Weierud.German Army Enigma Messages from July 1941. Frode Weierud's CryptoCellar. Retrieved 2026-11-05.
- ↑ 20.0 20.1 Michael Hörenberg.U534. ENIGMA M4. Retrieved 2026-11-05.
- ↑ 21.0 21.1 (2013-06-20).Enigma@Home: FNYG MXHU message broken. BOINC message boards. Retrieved 2026-11-05.
- ↑ 22.0 22.1 Enigma@Home front page (archived captures). Internet Archive. Retrieved 2026-11-05.
- ↑ (2019-08-18).Enigma@Home, failed to connect. r/BOINC. Retrieved 2026-11-05.
- ↑ (2019-05-13).Enigma at Home Tasks. r/gridcoin. Retrieved 2026-11-05.
- ↑ 25.0 25.1 Active projects last 24 hours. WUProp@Home. Retrieved 2026-11-05.
- ↑ Direct check of http://www.enigmaathome.net/ on 2026-11-05 returned no response.
- ↑ Frode Weierud.The MVUEH Break. Frode Weierud's CryptoCellar. Retrieved 2026-11-05.
- ↑ 28.0 28.1 Michael Hörenberg.News. ENIGMA M4. Retrieved 2026-11-05.
- ↑ (2026-09-19).Overview of still unbroken 1941 Messages. Frode Weierud's CryptoCellar. Retrieved 2026-11-05.
- ↑ 30.0 30.1 30.2 jbo-85/enigma-suite. GitHub. Retrieved 2026-11-05.
- ↑ Enigma@Home. BOINC Wiki (Mundayweb). Retrieved 2026-11-05.
- ↑ 32.0 32.1 32.2 Publications by BOINC Projects. BOINC. University of California, Berkeley. Retrieved 2026-11-05.