In addition to the Spanish decryption of a French cipher mentioned yesterday, Desenclos and Clinet (2025) presents their own decryption of a letter of Francis I to Christophe Richer, mbassador to Denmark (21 January 1547). The feat was achieved in February 2025 by Ioana Ionescu under the supervision of Paul Zimmermann and was completed and verified by Camille Desenclos with the key found in the archives (BnF NAF 8431, f.182). By comparing the ciphertext and plaintext, it can be seen that the cipher has homophones, double letters, nulls, and symbols for short words or titles ("que", "je", "faict", "et", "le roy de Danemarck", "Escossois", "le roy d'Angleterre", etc.).
They also present an undecoded letter of Mirabeau (the last image of the article). They give a date of 12 April 1787, but the cleartext seems to be "X. en reponse au no 3. le 12 aout". Anyway, if this is 1787, it is shortly after he came back in January 1587 from a stay in the Prussian court, where he had been sent on a mission by the Foreign Minister Vergennes. (His trip is recorded in Histoire secrete de la cour de Berlin (Internet Archive; translation: The Secret History oof the Court of Berlin (Internet Archive).)
The ciphertext is transcribed below:
549 1450 623 506 71 611 1296 61 57 1146 713 884 1017 878 556 655 846 703 991 984 791 806 1023 511 723 482 814 467 1090 1030 687 705 1151 426 934 1059 1002 99 1231 882 738 1199 1071
Mirabeau is said to have devised, during imprisonment when young, a cipher for representing a letter with two figures (LANAKI), but it would have been for personal use.
The short specimen above seems to be a full-fledged diplomatic code and has a number as high as 1450, which is higher than the size of typical French codes at the time (see my blogpost). It is wondered whether the code really had about 1500 entries (rather than using high numbers as nulls). If the above is all we've got, cryptanalysis would be impossible. But code numbers from the following page are faintly visible. If more pages (actually, it has to be many more pages) are available, it may be an interesting challenge for codebreakers.









