Polyalphabetic

The Quagmire I Cipher is a polyalphabetic substitution cipher designed to increase the security of classical ciphers by introducing a mixed alphabet keyed on a second keyword. It builds upon the Caesar Cipher concept, but instead of a fixed shift, each plaintext letter is encrypted using a shifting alphabet determined by a primary key (the first keyword) and a secondary key (the second keyword), which rotates the cipher alphabet for each letter. Padding characters like X are used to complete plaintext blocks when necessary.

The Portax Cipher is a classical polygraphic substitution cipher that combines elements of the Porta Cipher with structured digraph processing. It operates on pairs of letters and uses a repeating keyword to control how each pair is transformed. Unlike simple substitution ciphers, the Portax Cipher modifies both letters in a pair simultaneously, increasing diffusion and reducing recognizable patterns.

The Phillips Cipher is a classical polygraphic substitution cipher that encrypts plaintext by splitting it into fixed-size groups (typically digraphs or trigraphs) and then applying a series of transpositions and substitutions based on a keyword. It was designed to increase security over simple substitution ciphers by mixing the positions of letters within each group and leveraging the keyword to control letter mapping.

The Progressive Caesar Cipher is an evolution of the classic Caesar Cipher, introducing a dynamic, position-based shift rather than a fixed one. In this system, each successive plaintext letter is shifted by an incrementally increasing value, starting from an initial shift. This creates a ciphertext that is harder to analyze with frequency techniques than the standard Caesar method.

The Variant Beaufort Cipher is a classical polyalphabetic substitution cipher closely related to the Vigenère Cipher and the original Beaufort Cipher. It uses a repeating keyword to transform plaintext letters, but differs in the way the substitution is calculated. Instead of adding or subtracting shifts directly, the Variant Beaufort Cipher uses a reversed tabula recta relationship, producing a distinct encryption pattern.

The Two Square Cipher is a polygraphic substitution cipher that uses two separate 5x5 squares to encrypt pairs of letters. It is a variant of the Playfair Cipher but uses two grids instead of one, providing a more complex substitution for digraphs (pairs of letters). This cipher increases security by avoiding simple frequency analysis that single-letter substitution ciphers are vulnerable to.

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.

The Autokey Vigenère Cipher is an advanced polyalphabetic cipher that builds upon the classic Vigenère Cipher by incorporating an autokey mechanism. Instead of repeating a short keyword cyclically, the key is extended by appending the plaintext itself after the initial keyword. This produces a variable-length key, reducing repeating patterns in ciphertext and making frequency analysis considerably more difficult than in the standard Vigenère system.

The Wheatstone Cipher, also known as the Playfair Cipher, is a digraphic substitution cipher that encrypts pairs of letters (digraphs) rather than single letters. It was described by Charles Wheatstone in 1854 and later popularized by Lord Playfair. Its main advantage over simple substitution ciphers is that frequency analysis is more difficult because the unit of encryption is two letters instead of one.

The Trithemius Cipher is a polyalphabetic substitution cipher that shifts the alphabet progressively for each letter of the message. Instead of using a fixed shift like the Caesar Cipher, the shift increases step by step as the message is encoded.

The cipher was introduced by Johannes Trithemius in 1508. It works by applying a sequence of Caesar shifts to each letter of the plaintext. The first letter is shifted by 0, the second by 1, the third by 2, and so on. This changing shift produces a new substitution alphabet for every letter in the message.