Polyalphabetic Cipher – Algorithm and Process
A Polyalphabetic Cipher is a type of substitution cipher that uses multiple substitution alphabets to
encrypt the data. It improves upon monoalphabetic ciphers by reducing the effectiveness of
frequency analysis.
Encryption Algorithm
1. Choose a Keyword: The keyword determines the number of different alphabets used.
2. Repeat the Keyword: Match the length of the plaintext by repeating the keyword.
3. Encrypt Each Letter: For each letter in the plaintext, shift it using the Caesar cipher by the
position of the corresponding letter in the keyword (A=0, B=1, ..., Z=25).
Decryption Algorithm
1. Use the Same Keyword: Repeat it to match the ciphertext length.
2. Decrypt Each Letter: Shift each letter of the ciphertext in reverse by the keyword's corresponding
shift.
Example
Plaintext: ATTACKATDAWN
Keyword: LEMON
Extended Keyword: LEMONLEMONLE
Encryption Steps:
A (0) + L (11) = L
T (19) + E (4) = X
T (19) + M (12) = F
A (0) + O (14) = O
C (2) + N (13) = P
K (10) + L (11) = V
A (0) + E (4) = E
T (19) + M (12) = F
D (3) + O (14) = R
A (0) + N (13) = N
W (22) + L (11) = H
N (13) + E (4) = R
Ciphertext: LXFOPVEFRNHR
Advantages
- More secure than monoalphabetic cipher.
- Resistant to simple frequency analysis.
Disadvantages
- Still vulnerable to advanced cryptanalysis (e.g., Kasiski examination).
- Keyword must be kept secret and long enough.
Use Cases
- Historical encryption systems (e.g., Vigenère Cipher).
- Educational purposes.
