Vigenère Cipher Explained: Encryption, Decryption & Cryptanalysis

The One-Time Pad (OTP) is an improvement over Vernam cipher that provides theoretically unbreakable encryption. The process involves: (1) Assigning each character a numerical value (rank 0-25 or ASCII code), (2) Adding the plaintext value to the key value, (3) Taking the result modulo 26 (or 27 if including space), (4) Converting the result back to a character. The key must be truly random, at least as long as the plaintext, and used only once. For text with spaces, the alphabet size becomes 27 (26 letters + 1 space), and the modulo operation changes to mod 27.

The Vigenère cipher, once considered unbreakable, was proven vulnerable by Kasiski (1863) and Friedman (1920) when keys are short. Their attacks showed that repeated patterns in ciphertext reveal key length and eventually the key itself. This led to the one-time pad concept: a key as long as the message, completely random, and used only once. Under these conditions, the one-time pad is mathematically proven to be unbreakable (perfect secrecy), representing the gold standard of symmetric encryption.

A one-time pad (Vernam cipher) is the only mathematically unbreakable encryption algorithm. Claude Shannon proved that even infinite computational power cannot break properly implemented one-time pads because it is mathematically impossible. The system was used by WWII resistance groups, Cold War intelligence agencies, and continues protecting diplomatic/military communications worldwide. Five essential rules ensure security: key length matches message, key is truly random, calculations use modulo arithmetic, keys are never reused, and both parties destroy keys after use. Only two copies of each key should exist—one for sender, one for receiver. The complete operational workflow involves: (1) converting plaintext to plain code using a checkerboard table (frequent letters=1 digit, others=2 digits, spaces=99, numbers bracketed by 90 with digits repeated three times); (2) organizing into five-number groups; (3) adding spaces (99) to fill incomplete groups; (4) placing the one-time pad beneath plain code; (5) encrypting via subtraction without borrowing (add 10 when top number is smaller, drop carried ones); (6) decrypting via addition without carrying (drop tens place); (7) converting back to text. Code books enhance security by replacing complex terms with unique four-digit codes (prefixed with zero).

Vigenère cipher is a polyalphabetic substitution cipher that uses a keyword to determine the shift for each character. The encryption formula is C = (P + K) mod 26, where K is the keyword character position. The decryption formula is P = (C - K) mod 26. For example, with plaintext 'computer' and keyword 'ma': C(2)+m(12)=14→O, O(14)+a(0)=14→O, M(12)+m(12)=24→Y, P(15)+a(0)=15→P, U(20)+m(12)=32 mod 26=6→G, T(19)+a(0)=19→T, E(4)+m(12)=16→Q, R(17)+a(0)=17→R. The ciphertext is 'OOPYG TQR'. One-Time Pad (OTP) is a theoretically unbreakable encryption method where each plaintext character is XORed with a random key character. The key must be truly random, as long as the plaintext, and used only once. For example, with plaintext 'hello' and key 'world': h(7) XOR w(22) = 17 → r, e(4) XOR o(14) = 10 → k, l(11) XOR r(17) = 24 → y, l(11) XOR l(11) = 0 → a, o(14) XOR d(3) = 13 → n. The ciphertext is 'rkyan'.

The Vigenère cipher extends the Caesar cipher by using a keyword where each letter determines a different shift value for each plaintext letter, with the keyword repeated to match plaintext length. Mathematically: Ciphertext = (Plaintext + Key) mod 26. This polyalphabetic approach means the same plaintext letter can encrypt to different ciphertext letters depending on the key letter, breaking the frequency distribution correlation. The One-Time Pad represents the extreme case where the key is random, as long as the plaintext, and never reused, providing unconditional security. The ciphertext provides no information about the plaintext without the key. Even with brute-force attacks trying all possible keys, multiple plaintexts may make sense, making it impossible to identify the correct one. However, the main practical limitation is key distribution: the key must be shared securely before communication, which is impractical for long messages.

Hill Cipher is a polygraphic substitution cipher developed by Lester Hill in 1929 that encrypts multiple letters simultaneously using matrix multiplication, where plaintext letters are converted to numbers (A=0, B=1, ..., Z=25), arranged as a vector, multiplied by a key matrix modulo 26 to produce ciphertext; for example, with a 3×3 key matrix, three plaintext letters are encrypted at once, and decryption requires multiplying ciphertext by the inverse of the key matrix modulo 26.

The Hill cipher is a polygraphic encryption method that encrypts blocks of M letters simultaneously using matrix multiplication modulo 26, rather than letter-by-letter substitution. The encryption process involves: (1) converting letters to numerical values (A=0, B=1, ..., Z=25), (2) dividing the message into M-letter blocks, (3) multiplying each block by an M×M key matrix Q modulo 26, and (4) converting the resulting numerical values back to letters. This approach provides resistance to statistical attacks because the same plaintext letter encrypts to different ciphertext letters depending on its position within the message block. For example, encrypting 'élection' with a 2×2 key matrix [[3,5],[1,2]] produces 'PAWITJDO', where the two 'E's encrypt to different letters (P and W).

The Hill Cipher is a polygraphic substitution cipher based on linear algebra that encrypts messages by converting plaintext letters to numbers (A=0, B=1, ..., Z=25), arranging them into matrices, multiplying by an invertible key matrix, applying modulo 26 to the results, and converting the final numbers back to letters to produce the ciphertext.

The Hill Cipher, developed by mathematician Lester Hill in 1929, is a polygraphic substitution cipher that encrypts multiple letters simultaneously using matrix multiplication (C = KP mod 26), making frequency analysis more difficult; decryption requires the key matrix to be invertible modulo 26, which is ensured by checking that the determinant is non-zero and coprime to 26, and finding the modular inverse through the Extended Euclidean Algorithm.

The Hill Cipher is a polyalphabetic substitution cipher invented by American mathematician Lester Hill in 1929 that encrypts messages by multiplying letter blocks (converted to numbers 0-25) with a secret matrix modulo 26, where the matrix must have a determinant coprime to 26 to ensure a unique decryption key exists.

This section covers the transition from simple substitution to modern symmetric encryption. Confusion (bit substitution) and diffusion (one bit change affects many ciphertext bits) are fundamental principles. DES (1977) used 56-bit keys and 64-bit blocks, but was deemed insecure. Triple DES (1998) addressed this by applying DES three times with three 56-bit keys (168-bit effective key). AES (2001), designed by Rijmen and Daemen, uses 128-bit blocks and 128/192/256-bit keys, applying confusion and diffusion 10-14 times. Despite theoretical vulnerabilities (XSL attack, related key attacks), the key space (2^128) makes brute force impractical.

Modern block ciphers combine two fundamental principles: confusion (making key-ciphertext relationship complex using S-boxes) and diffusion (spreading plaintext influence across ciphertext using P-boxes). The Feistel structure uses both principles in each round. The number of rounds (10-14 for AES) balances security against computational cost. Too few rounds leave the cipher vulnerable to differential attacks, while too many slow performance. The analogy of making mayonnaise illustrates this: insufficient mixing leaves visible ingredients, while proper mixing creates a uniform emulsion.

Symmetric cryptography uses the same key for encryption and decryption, requiring secure key exchange. Asymmetric cryptography uses public and private key pairs. The key exchange problem in symmetric cryptography is fundamental: parties must share a secret key securely before communication. The number of keys needed for n users is n(n-1)/2, which grows exponentially (100 users need 4,950 keys). Claude Shannon identified confusion (substitution) and diffusion (permutation) as fundamental principles for secure encryption. Block ciphers process data in fixed-size blocks (64 or 128 bits). DES (Data Encryption Standard) uses 64-bit blocks and 56-bit effective keys (8 bits for parity), with 16 rounds of substitution and permutation. DES is vulnerable to brute-force attacks: 97 days in 1997, 41 days in 1998 with 100,000 computers, and 56 hours for $210,000 by July 1998. 3DES applies DES three times with two or three keys, providing 112-168 bits of security. AES (Advanced Encryption Standard) was selected in 2001 from five finalists (MARS, RC6, Rijndael, Serpent, Twofish). Rijndael won due to its balance of security, speed, and implementation flexibility. AES uses 128-bit blocks and supports 128, 192, or 256-bit keys with 10-14 rounds. AES is now the dominant encryption standard worldwide, used in virtually all modern systems.

Modern symmetric ciphers are categorized into stream ciphers (encrypting data byte-by-byte) and block ciphers (processing fixed-size blocks of 64+ bits). AES (Advanced Encryption Standard) emerged as the dominant block cipher after NIST's 1997 competition to replace DES. The selection process received 15 round-1 submissions, narrowing to five finalists before choosing Rijndael. AES operates on 128-bit blocks and represents the culmination of a transparent, competitive standardization process unlike DES's more secretive development.

Claude Shannon established two fundamental principles for secure cryptography: diffusion and confusion. Diffusion spreads the influence of plaintext bits across many ciphertext bits, achieved through permutation operations that rearrange bits or bytes. Confusion obscures the relationship between ciphertext and plaintext, typically achieved through substitution operations. Modern symmetric block ciphers like DES and AES implement both principles: diffusion through bit/byte permutations and confusion through substitution boxes (S-boxes). These principles remain foundational to modern cryptographic design.