Homophonic Substitution Cipher

About this calculator

A homophonic substitution cipher improves on a plain substitution cipher (where each letter always maps to the same symbol) by giving common letters several interchangeable codes instead of just one. Because a letter like “e” might be replaced by any of several different 2-digit numbers depending on where it appears, the resulting ciphertext has a flatter, more uniform distribution of symbols, which defeats simple frequency analysis — the classic technique of counting symbol frequency to guess which cipher-symbol represents “e”, “t”, and so on.

Historical nomenclators and “great ciphers” used by diplomats and spies from the Renaissance through the 19th century (and famously the unsolved Zodiac Killer’s 340-character cipher) relied on this same many-to-one idea. This tool is an educational demonstration: type a message and it encodes each letter into a 2-digit code that shifts with position, letting you see how homophonic substitution scrambles letter frequency compared to a simple one-to-one cipher.