Homophonic Substitution Cipher

How Homophonic Substitution Cipher works

Homophonic Substitution Cipher handles each plaintext letter to one of two numeric symbols, alternating choices when that same letter repeats instead of using a single fixed substitute. Codes 01 through 26 represent A through Z, while 27 through 52 provide a second homophone. Decode mode folds both ranges back to the same 26 letters. The Homophonic Substitution Cipher exposes its message or two-digit symbols, operation controls so this particular convention stays inspectable instead of hiding behind an unexplained preset.

HELLO becomes 08 05 12 38 15: the first L uses 12 and the second uses its alternate 38, while both decode as L. Students can see the core idea behind flattening letter frequencies without needing a random table that would make examples impossible to reproduce. The Homophonic Substitution Cipher presents a deterministic plain-text result that can be copied and compared with the worked value before it enters another workflow.

Limits and private processing

Real historical systems assign more symbols to frequent letters and choose among them variably. This deterministic two-symbol model is transparent but not secure. The Homophonic Substitution Cipher performs its complete operation locally in your browser; neither the source text nor its settings are uploaded, stored remotely, or sent through an external request.