The Cadenus–Gronsfeld Cipher is a variation of the Gronsfeld Cipher, itself a numeric version of the Caesar Cipher. It operates on alphabetic text by shifting each letter according to a repeating numeric key, but with the added twist that the key may include a reversible sequence or "cadenus" pattern, providing irregularity in the shifts. This makes it a hybrid between classical polyalphabetic ciphers and simple numeric substitution, increasing resistance to frequency analysis.
Like the Gronsfeld Cipher, the Cadenus–Gronsfeld Cipher is fully symmetric: encryption and decryption use the same key, applied in the same numeric sequence. The difference lies in the use of a cadenus (repeating or mirrored numeric pattern) to alter the standard key sequence, creating a subtle layer of unpredictability while retaining the cipher's straightforward arithmetic nature.
Cadenus–Gronsfeld Cipher: Encoding
Each plaintext letter is converted to a numeric value (A=0 to Z=25), then shifted by the corresponding digit in the numeric key sequence. For example, using the key 3142 and encoding “HELLO”:
Plaintext: H E L L O
Numeric: 7 4 11 11 14
Key digits (cadenus pattern 3142): 3 1 4 2 3
Shift (mod 26):
7+3=10 → K
4+1=5 → F
11+4=15 → P
11+2=13 → N
14+3=17 → R
Ciphertext: K F P N RCadenus–Gronsfeld Cipher: Decoding
Decryption reverses the shifts by subtracting the same key digits modulo 26:
Ciphertext: K F P N R
Numeric: 10 5 15 13 17
Key digits: 3 1 4 2 3
Subtract (mod 26):
10-3=7 → H
5-1=4 → E
15-4=11 → L
13-2=11 → L
17-3=14 → O
Plaintext: H E L L OCadenus–Gronsfeld Cipher: Notes
The Cadenus–Gronsfeld Cipher is an elegant illustration of numeric polyalphabetic ciphers. By introducing the cadenus pattern, it adds irregularity while remaining easy to compute by hand. Its relationship to the Gronsfeld Cipher and Caesar Cipher highlights the evolution from fixed-shift substitution to variable-key arithmetic methods in classical cryptography.