Contribute Media
A thank you to everyone who makes this possible: Read More

Solving very simple substitution ciphers algorithmically


A historical text may now be unreadable, because its language is unknown, or its script forgotten (or both), or because it was deliberately enciphered. Deciphering needs two steps: Identify the language, then map the unknown script to a familiar one. I’ll present an algorithm to solve a cartoon version of this problem, where the language is known, and the cipher is alphabet rearrangement.


Improve this page