The Porta Cipher is a classical polyalphabetic substitution cipher named after the Italian scholar Giambattista della Porta, who described it in the 16th century. It is a variant of the polyalphabetic cipher family, similar in principle to the Vigenère Cipher, but with a reciprocal structure that makes encoding and decoding symmetrical—using the same process in reverse produces the original text.

The cipher uses a 26-letter alphabet split into 13 pairs (A/N, B/O, C/P, etc.). A key word or phrase determines which shifted alphabet to use for each letter of the plaintext. For each letter, the Porta table is consulted to substitute letters based on the key. Its reciprocal nature simplifies decryption, as the same key sequence and method work for both encoding and decoding.

Porta Cipher: Encoding

To encode a message, select a key (e.g., KEY) and repeat it to match the length of the plaintext. For each plaintext letter, consult the Porta table corresponding to the key letter to find the ciphertext letter. For example, encoding HELLO with the key KEY:

Plaintext:  H  E  L  L  O
Key:        K  E  Y  K  E

Using the Porta table for each key letter:

H → Z (key K)
E → T (key E)
L → X (key Y)
L → Q (key K)
O → M (key E)

Ciphertext: Z T X Q M

Porta Cipher: Decoding

To decode, use the same key sequence and table. Each ciphertext letter is substituted back according to the corresponding key letter:

Ciphertext: Z  T  X  Q  M
Key:        K  E  Y  K  E

Decoding with the Porta table:

Z → H
T → E
X → L
Q → L
M → O

Plaintext: HELLO

Porta Cipher: Notes

The Porta Cipher’s main strength lies in its polyalphabetic nature and reciprocal property. While not as secure as modern cryptography, it was historically effective against simple frequency analysis. Its design demonstrates early experimentation with shifting alphabets and key-based encryption, bridging the conceptual gap between monoalphabetic ciphers and more sophisticated polyalphabetic systems like the Vigenère Cipher.

Porta Cipher