Digraph

The Digraph Cipher is a classical encryption method that processes plaintext two letters at a time — forming units known as digraphs. By operating on pairs instead of single characters, it disrupts simple letter-frequency patterns, making it more resilient than monoalphabetic systems like the Simple Substitution Cipher.

This approach typically uses a 5×5 grid (with I and J combined) to assign positional coordinates to each letter. Each digraph is encoded by translating its letters into grid positions and recombining them through a fixed rule, producing the final ciphertext.

Digraph Cipher: Encoding

Consider the plaintext HELLO. First, divide it into digraphs: HE, LL. Because the length is odd, a filler X is appended, forming the final pair OX.

Plaintext Digraphs: HE  LL  OX

Using a 5×5 grid (I/J combined), each letter is mapped to its coordinate, and the digraphs are transformed according to the cipher’s rule. Applying this process yields:

HE → KC
LL → LL
OX → NY

Writing the results in sequence produces the ciphertext:

Ciphertext: KC LL NY

Digraph Cipher: Decoding

Decoding reverses the process. Each ciphertext digraph is interpreted back into its corresponding letter pair:

Ciphertext: KC LL NY
Mapping back:

KC → H E
LL → L L
NY → O X

Plaintext: HELLOX

Digraph Cipher: Notes

By encoding letter pairs through positional relationships rather than direct substitution, the Digraph Cipher reduces predictable patterns in the output. This polygraphic behavior strengthens the cipher and serves as a conceptual stepping stone toward more advanced systems like the Bifid Cipher, which further blends substitution with transposition for increased complexity.