Unveil

Code

Reading a text without its key: naming the cipher, peeling off encodings, counting letters, measuring an unknown script, breaking nomenclators, reading messages in depth, replaying the Enigma breaks, checking anagrams.

Solution Check

Tries a claimed reading of a ciphertext, no key given, against the cipher’s rule: the key the reading implies, every place that contradicts it, and how often the ciphertext could have refuted it, beside the same reading on the ciphertext shuffled. Consistency is not proof: Shannon’s unicity distance says when more than one reading fits.

Terms

History, how it works, how it was checked, limits

History

A decipherment has always been judged by whether its key, once stated, turns the whole ciphertext into sense without exceptions. Shannon gave the reason a short text cannot settle it: below the unicity distance, which he defined in 1949 as the length at which the key’s uncertainty is used up by the language’s redundancy, several keys give readable text. The check here is Unveil’s own arrangement of those two ideas, made for a time when readings are offered without their keys.

How it works

The ciphertext’s signs are set over the letters of the reading claimed for it; no key is asked for. As a substitution, each sign must be read one way throughout, and in a simple one each letter must have one sign. As a periodic cipher, each place implies a key letter, and the period under which they repeat best is found. As a transposition, the letters must be the same, and a columnar key, rail fence, scytale or reversal is searched for. The measure is the test: a sign’s first appearance can be given any letter, so only its later appearances could have refuted the reading. The same count is made on the ciphertext shuffled, two hundred times from a seed. What the ciphertext never fixes is listed.

How it was checked

Poe’s cryptogram in The Gold-Bug is checked with the reading his story gives: it holds at all 183 tests, and the key implied is the one he prints. The tests also encipher a sentence with the site’s engines and require the true reading to hold with the key recovered, a reading with one word changed to fail at exactly the changed letters, and an unrelated text of the same length to pass about as many tests as on the shuffled ciphertext. The figure is held to the places the check marks.

The tests hold 18 checks of this tool; 1 rests on outside material:

  • A print’s own example Poe’s own example in The Gold-Bug (1843): Legrand’s reading of the cryptogram’s 203 signs holds as a simple substitution, 20 signs, tested 183 times and never contradicted; two signs occur once

Every tool’s checks

Limits

A reading that holds is consistent, not proved: a short ciphertext, or a homophonic one with many signs, is tested seldom, and the tool says how seldom. A reading that drops or adds a sign is out of step from that place on; no alignment is searched. Transposition keys beyond the four kinds are not found. Machines, digraphic ciphers and nomenclators are not checked: with a key in hand, the cipher’s own tool applies it.