Porta Cipher
A 13-row polyalphabetic cipher from the Renaissance master of secrets
Index of Coincidence · Statistical analysis
Why This Matters
Porta’s 1563 book describes reciprocal polyalphabetic substitution. This demo uses the modern 26-letter, 13-row adaptation; the historical alphabet and table were smaller. It should not be mistaken for an exact facsimile of the original table.
Giambattista della Porta discussed secret writing in De Furtivis Literarum Notis (1563). The reciprocal tables associated with his name can use the same operation for encryption and decryption.
In the modern table shown here, two key letters select each of 13 reciprocal substitutions. The number of rows alone does not determine overall security: period, message length and language statistics also matter.
The Porta cipher uses a 13-row tableau where each row is labeled with a pair of key letters (AB, CD, EF…). To encrypt:
- Find the row whose label contains the current key letter
- Look up the plaintext letter in that row
- The paired letter in the row is the ciphertext
Because rows are symmetric, the same operation decrypts — making it reciprocal like Beaufort.
Repeating key positions expose related substitution problems. Index-of-coincidence and repetition tests can suggest periods, but do not guarantee the true key length. Candidate keys still need to be checked against the complete ciphertext.
| Concept from Porta Cipher | Modern Evolution |
|---|---|
| 13-row reciprocal tableau | Reciprocal substitutions share one operation; symmetric-key encryption in general need not be self-inverse |
| Paired key letter lookup | S-box lookup tables in AES SubBytes step |
| Smaller table for field use | Hardware-optimized cipher implementations |
| Exhibit | 10 of 172 |
| Era | Renaissance · 1563 |
| Trust | Broken |
| Inventor | Giambattista della Porta |
| Year | 1563 |
| Key Type | Repeating keyword (pair-based) |
| Broken By | Index of Coincidence · Statistical analysis |