The D'Agapeyeff cryptogram as printed in 1939, 392 digits grouped in fives

Research · 6/12

Agapeyeff cipher cryptanalysis

I tried to crack, by computational cryptanalysis, the challenge cryptogram that Alexander D'Agapeyeff (1902-1955), a cartographer and Royal Air Force officer, published at the end of the first edition of his handbook Codes and Ciphers (Oxford University Press, 1939). Nobody has solved it since, and its 392 digits even vanished from later editions. This is an independent research study.

The cryptogram

The 392 digits read in pairs, like coordinates in a 5×5 Polybius grid, which gives a message of 196 symbols. What remains is to find which cipher was applied on top, in which language and with which key.

A first solver that had to be rebuilt

The first difficulty did not come from the cipher but from the solver. Its first version judged a result promising above a score threshold that had been fixed in advance and never checked. After three days of continuous computing, nothing had crossed it. The tempting conclusion would have been that the text was not English, or that D'Agapeyeff had made a mistake.

I preferred to test the threshold itself. A genuine excerpt from Pride and Prejudice, scored with the same model, did not reach it either. The threshold was out of reach even for real English text, because the language model had only been trained on 8,000 characters.

The rebuilt solver

I rebuilt the solver around four ideas.

For the Four-square cipher, I even measured the annealing setup. 40 restarts of 300,000 iterations find the right key in 83% of test runs, against 58% for 20 restarts of 250,000 iterations.

Result

I detected no signal statistically distinguishable from noise on methods A to D, with 100% coverage guaranteed over two independent passes. The Four-square cipher was covered to 20.9% of its search space, also without a signal. It is a negative result, but I documented it in detail, with the associated code and data, so the research can resume exactly where it stopped.

Citing this work

The work is published in open access on Zenodo.

87 years Unsolved since 1939
3,753,383 Logged attempts

Documents

See all projects