Vigenère cipher
The Vigenère cipher shifts each letter by a different amount, set by a keyword that repeats along the message. For three centuries it had a reputation as le chiffre indéchiffrable, the unbreakable cipher.
A little history
The method was first published by Giovan Battista Bellaso in 1553, but in the 1800s it became credited to the French diplomat Blaise de Vigenère, and the name stuck. Because each letter can become many different letters, simple letter counting doesn't work, and the cipher earned its unbreakable reputation. It was broken in the mid-1800s, first by Charles Babbage, who never published his method, and then by the Prussian officer Friedrich Kasiski, who did, in 1863.
How it works
- Choose a keyword, for example
LEMON. - Write it repeatedly under the message.
- Shift each message letter by its key letter, counting A = 0, B = 1 … Z = 25.
| Message | A | T | T | A | C | K | A | T | D | A | W | N |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Key | L | E | M | O | N | L | E | M | O | N | L | E |
| Cipher | L | X | F | O | P | V | E | F | R | N | H | R |
ATTACKATDAWNLEMONLEMONLELXFOPVEFRNHRNotice the two T's in ATTACK become X and F: the same letter encrypts differently depending on where it falls.
How to crack it
Kasiski's insight was that the keyword repeats. If the same word appears twice in a long message at a distance that's a multiple of the keyword length, it encrypts the same way both times, leaving a repeated group in the ciphertext. Measure the gaps between repeats and their common factor reveals the keyword length. Then split the message into that many columns: each column is just a shift cipher, which you crack by letter counting.
Vigenère in Cyrune
Cyrune's Vigenère uses a two-letter key, so letters 1, 3 and 5 share one shift and letters 2 and 4 share another. A green tile tells you one key letter exactly, and that key letter also unlocks every other position that shares it.
Related ciphers
- Autokey cipher ★★★☆☆
- Beaufort cipher ★★★★☆
- Running key ★★★★★