Cipher methods Polyalphabetic
Bellaso cipher
The direct ancestor of Vigenère: polyalphabetic with a text key, invented thirty years before Vigenère's publication.
- Family :
- Polyalphabetic
- Difficulty :
- Intermediate
- Era :
- 1553, Giovan Battista Bellaso
- Inventor :
- Giovan Battista Bellaso
The Bellaso cipher was described by the Italian cryptographer Giovan Battista Bellaso in La cifra del Sig. Giovan Battista Bellaso in 1553 — a full thirty-three years before the publication of the so-called “Vigenère” cipher. By a twist of history, credit went to Vigenère, who published his version in 1586; Bellaso fell into relative obscurity.
Principle
Bellaso proposed several successive tables over his career (1553, 1555, 1564), all built on the same idea: a mapping table driven by a text key repeated cyclically beneath the plaintext. Each key letter picks a row; the plain letter picks the column.
The most famous table is the 1564 one, which departs slightly from the tabula recta by using permuted rows instead of shifted alphabets. But the operational principle is identical to Vigenère’s:
C_i = f(P_i, K_i) where f depends on the table
For teaching purposes, Bellaso is often presented today with the Vigenère table, which makes it literally Vigenère.
Example
Plaintext CIPHERCHRONICLE with key BELLASO (cycled BELLASOBELLASOB) and Vigenère table:
C + B → D I + E → M P + L → A H + L → S E + A → E
R + S → J C + O → Q H + B → I R + E → V O + L → Z
N + L → Y I + A → I C + S → U L + O → Z E + B → F
Result: DMASEJQIVZYIUZF.
Historical importance
- 1553: Bellaso publishes his first treatise. He introduces the idea of a short text key repeated cyclically — the modern Vigenère key.
- 1586: Blaise de Vigenère publishes Traicté des chiffres, reusing Bellaso’s idea and adding the autokey (extending the key with plaintext). Posterity remembers Vigenère’s name.
- 1863: Kasiski breaks Vigenère (and thus Bellaso) with his repetition-analysis method.
Weaknesses
Identical to Vigenère — Bellaso shares the repeated-key structure:
- Kasiski to recover the period.
- Index of coincidence to confirm the length.
- Each column is a Caesar, cracked by frequency analysis.
In CipherChronicle
Bellaso offers a chance to give credit where it’s due… to Bellaso, not Vigenère. Grids built on it can lean on this historical anecdote to introduce the notion of scientific priority in classical cryptography.
Grid
- 1
Ciphertext
Flat distribution, repeated key — close to Vigenère, historically earlier.
- 2
Key period search
Kasiski and the index of coincidence work just as for Vigenère.
- 3
Hypothesis: key « BELLASO » (length 7)
Once the period is known, each column is a Caesar.
- 4
Apply the Bellaso table
Each key letter selects a row; the plain letter is shifted accordingly.
- 5
Message revealed
The plaintext surfaces once the cyclic shifts are applied.