Slidefair cipher

The Slidefair cipher is a clever hybrid combining Vigenère (repeating key, multiple shifts) and Playfair (digram encryption). Mid-20th-century amateur cryptography literature describes it as a fix for the respective weaknesses of both ancestors: Vigenère falls to Kasiski, Playfair to digram-frequency analysis.

Principle

Slidefair leans on the standard Vigenère table (the 26 shifted alphabets), but it does not encrypt letter-by-letter — it encrypts pair-by-pair. Each plain digram is enciphered using one key letter as parameter:

1. Split the plaintext into digrams: CI PH ER CH RO NI CL E·.
2. For each digram (P₁, P₂), take the current key letter K (the key cycles through the message).
3. Find P₁ on row K of the Vigenère table, and P₂ on row A (the standard alphabet).
4. The cipher digram (C₁, C₂) is read off by completing a rectangle: C₁ sits on row A at the same column as P₁ on row K; C₂ sits on row K at the same column as P₂ on row A.

Decryption applies the same rule in reverse.

Example

With key KEY and plaintext CIPHER CHRON ICLE, split into CI PH ER CH RO NI CL E· and assign key letters K E Y K E Y K. Each pair is processed independently — K sets the shift for the first element, the second is fixed by the rectangle’s symmetry.

Strengths and weaknesses

Strengths

• Letter-frequency flattening — like Playfair, the digram is the unit; the letter histogram tells you nothing.
• Period removal — like long-key Vigenère, the working alphabet changes from digram to digram.
• No “double letter” patch — unlike Playfair, Slidefair does not insert a stray X when a digram contains two equal letters.

Weaknesses

• Digrams are still the real unit — digram-frequency analysis works; TH, HE, IN, ER will surface with enough material.
• The key is still cyclic — running Kasiski on digrams (instead of letters) recovers the key length within a few hundred digrams.
• Length-parity glitch — odd-length messages must be padded, usually with X.

How to attack it by hand

1. Split the ciphertext into digrams.
2. Count the most frequent digrams: look for analogues of TH, HE, IN.
3. Digram Kasiski — find recurring cipher digrams at multiple distances; their GCD reveals the key length.
4. Once the key is known, deciphering each pair is a mechanical rectangle lookup.

For messages under 100 digrams, the manual attack is tedious but tractable.

Variants

• Slidefair on two different rows — instead of row A for P₂, use another row driven by a second key, doubling the keyspace.
• Slow Slidefair — the key advances by one letter every two digrams, lengthening the effective period.

In CipherChronicle

Slidefair is the perfect rung between mastering Vigenère and mastering Playfair: it teaches the player to switch from letter to digram as the analytic unit. Slidefair puzzles will reward that pivot — the “letter histogram” reflex fails, the “pair histogram” reflex pays off.