Solving very simple substitution ciphers algorithmically

Loading

SWIPE ↑ or

Introductory Video

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. Slides: https://www.slideshare.net/PyData/solving-very-simple-substitution-ciphers-algorithmically-stephen-enrightward --- www.pydata.org
Comment On Twitter