Obfuscation

Morse Code is a communication system that encodes letters, numbers, and punctuation into sequences of short and long signals, known as dits (·) and dahs (–). Developed by Samuel Morse and Alfred Vail in the 1830s–1840s, it was originally used for telegraph transmission but has since become a standard for signaling across many media. Each character in the plaintext is represented by a unique pattern of dots and dashes.

The Index Card Cipher is a manual polyalphabetic substitution cipher that uses a set of shuffled alphabets (cards) to encode plaintext. Each card represents a full alphabet in a predetermined, scrambled order. By arranging and cycling through these cards according to a numeric key sequence, the plaintext letters are substituted in a way that depends on both the card and the position of the letter, increasing encryption complexity.

The Cardan Grille Cipher is a classical steganographic and transposition cipher attributed to Girolamo Cardano in the 16th century. It uses a physical grille—a piece of cardboard or paper with cut-out holes—to determine the positions in a blank text grid where plaintext letters are written. The remaining empty spaces are filled with null letters or random filler text, creating a seemingly innocuous message that conceals the true content.

The D’Agapeyeff Polybius Cipher is a classical cipher named after Alexander D’Agapeyeff, who documented it in his 1939 book Codes and Ciphers. It is a type of Polybius (Square) Cipher that uses a 5×5 grid to convert letters into coordinates, typically numbers, which can then be transmitted or further encrypted. This method converts each letter of plaintext into a pair of digits representing its row and column in the grid.

The Columnar Transposition Cipher is a classical transposition method that encrypts a message by rearranging entire columns of text according to a keyword. Unlike substitution systems such as the Caesar Cipher, the letters themselves are not altered — only their positions are changed.

It expands upon the simpler Columnar Cipher by explicitly reordering columns based on the alphabetical ranking of the keyword. This column permutation is the defining feature of the cipher.

The Zigzag Cipher is a transposition cipher that rearranges the letters of a message in a zigzag pattern across multiple rows (rails) and then reads them row by row to produce the ciphertext. It is similar in principle to the Rail Fence Cipher but emphasizes the visual zigzag path of letters. The cipher relies on the number of rows as the key to determine the path and order of characters.

The Straddling Checkerboard Cipher is a substitution cipher that encodes letters into digits using a numeric grid with main rows and offset rows. Common letters are assigned a single digit in the main rows, while less frequent letters use one of the offset rows as a prefix to create a two-digit code. This method compresses messages and provides a simple layer of obfuscation.

The Semaphore Cipher is a visual signaling cipher that encodes letters using flag positions. Each letter of the alphabet is mapped to a unique combination of symbols representing the positions of two flags. Historically, it was used for maritime and military communication, allowing messages to be sent across distances without electronic devices.

In this version, each letter is represented by a pair of symbols based on a standard semaphore mapping. Spaces between words are preserved, but the letters themselves are replaced by their semaphore symbol pairs.

The M‑209 Cipher is a portable mechanical encryption device used by the U.S. Army during World War II for tactical field communications. It employs six rotating key wheels, each with a different number of pins, and a set of lugs connecting pairs of wheels. When a letter is entered, the current wheel positions and lug connections generate a polyalphabetic shift. Each subsequent letter causes the wheels to step, producing a dynamic substitution pattern.

The Knapsack Cipher is a public-key cryptosystem based on the mathematical problem of the subset sum, also known as the "knapsack problem." It was one of the first attempts at a public-key encryption scheme, proposed by Ralph Merkle and Martin Hellman in 1978. The cipher transforms a plaintext message into a binary representation and encodes it as a sum of elements from a specially chosen sequence, making decryption without the private key computationally difficult.