Gronsfeld cipher

The Gronsfeld cipher was devised by Count José de Bronckhorst de Gronsfeld in the 17th century. It is essentially a Vigenère whose key is a sequence of digits (0-9) instead of letters. That simplification has a practical edge: no Vigenère table to memorize — you just count on your fingers.

Principle

The key is a digit sequence, written cyclically beneath the plaintext. Each digit gives the shift applied to the letter above:

C_i = (P_i + K_i) mod 26, with K_i ∈ {0, …, 9}

With a key of length n, only 10ⁿ combined shifts are possible — far fewer than Vigenère’s 26ⁿ.

Example

Plaintext CIPHERCHRONICLE with key 531 (cycled 531531531531531):

C + 5 → H    E + 3 → H    R + 1 → S    I + 1 → J
I + 3 → L    R + 1 → S    O + 5 → T    C + 5 → H
P + 1 → Q    C + 5 → H    N + 3 → Q    L + 3 → O
H + 5 → M    H + 3 → K                 E + 1 → F

Result: HLQMHSHKSTQJHOF.

Strengths and weaknesses

Strengths

• Trivial memorization: a 6-digit key fits in anyone’s head.
• Fast application: counting 0 to 9 takes less focus than using a table.

Weaknesses

• Small keyspace: a 5-digit key yields only 10⁵ = 100 000 possibilities — instant brute force on any computer, hours by hand on short messages.
• Kasiski still works: like Vigenère, periodicity leaks the key length.
• Per-column frequency analysis: once the length is known, each column is a Caesar with shift between 0 and 9 — even smaller space (10 options per column).

Variants

• Vigenère — alphabetic-key generalization (26 possible shifts).
• Numeric Beaufort — involutive Gronsfeld with C = (K − P) mod 26.
• Numeric One-Time Pad — Gronsfeld with a random key as long as the message, never reused: unbreakable.

In CipherChronicle

Gronsfeld is a beginner-friendly Vigenère: same mechanic, more tangible keyspace. Its grids can be solved in your head after a bit of practice, making it a great bridge between Caesar (key = 1 digit) and Vigenère (alphabetic key).