3.2.
2 Polyalphabetic Ciphers
In polyalphabetic substitution, each occurrence of a
character may have a different substitute. The relationship
between a character in the plaintext to a character in the
ciphertext is one-to-many.
Autokey Cipher
3.1
3.2.2 Continued
Example 3.14
Assume that Alice and Bob agreed to use an autokey cipher with
initial key value k1 = 12. Now Alice wants to send Bob the message
“Attack is today”. Enciphering is done character by character.
3.2
3.2.2 Continued
Playfair Cipher
Figure 3.13 An example of a secret key in the Playfair cipher
Example 3.15
Let us encrypt the plaintext “hello” using the key in Figure 3.13.
3.3
3.2.2 Continued
Vigenere Cipher
Example 3.16
We can encrypt the message “She is listening” using the 6-character
keyword “PASCAL”.
3.4
3.2.2 Continued
Example 3.16
Let us see how we can encrypt the message “She is listening” using
the 6-character keyword “PASCAL”. The initial key stream is (15, 0,
18, 2, 0, 11). The key stream is the repetition of this initial key stream
(as many times as needed).
3.5
3.2.2 Continued
Example 3.17
Vigenere cipher can be seen as combinations of m additive ciphers.
Figure 3.14 A Vigenere cipher as a combination of m additive ciphers
3.6
3.2.2 Continued
Example 3.18
Using Example 3.18, we can say that the additive cipher is a special
case of Vigenere cipher in which m = 1.
Table 3.3
A Vigenere Tableau
3.7
3.2.2 Continued
Vigenere Cipher (Crypanalysis)
Example 3.19
Let us assume we have intercepted the following ciphertext:
The Kasiski test for repetition of three-character segments yields the
results shown in Table 3.4.
3.8
3.2.2 Continued
Example 3.19
Let us assume we have intercepted the following ciphertext:
The Kasiski test for repetition of three-character segments yields the
results shown in Table 3.4.
3.9
3.2.2 Continued
Example 3.19 (Continued)
The greatest common divisor of differences is 4, which means that the
key length is multiple of 4. First try m = 4.
In this case, the plaintext makes sense.
3.10
3.2.2 Continued
Hill Cipher
Figure 3.15 Key in the Hill cipher
Note
The key matrix in the Hill cipher needs to
have a multiplicative inverse.
3.11
3.2.2 Continued
Example 3.20
For example, the plaintext “code is ready” can make a 3 × 4 matrix
when adding extra bogus character “z” to the last block and removing
the spaces. The ciphertext is “OHKNIHGKLISS”.
Figure 3.16 Example 3.20
3.12
3.2.2 Continued
Example 3.21
Assume that Eve knows that m = 3. She has intercepted three
plaintext/ciphertext pair blocks (not necessarily from the same
message) as shown in Figure 3.17.
Figure 3.17 Example 3.21
3.13
3.2.2 Continued
Example 3.21 (Continued)
She makes matrices P and C from these pairs. Because P is invertible,
she inverts the P matrix and multiplies it by C to get the K matrix as
shown in Figure 3.18.
Figure 3.18 Example 3.21
Now she has the key and can break any ciphertext encrypted with that
key.
3.14
3.2.2 Continued
One-Time Pad
• One of the goals of cryptography is perfect secrecy.
• A study by Shannon has shown that perfect secrecy can be
achieved if each plaintext symbol is encrypted with a key
randomly chosen from a key domain.
• This idea is used in a cipher called one-time pad, invented
by Vernam.
3.15
3.2.2 Continued
Rotor Cipher
Figure 3.19 A rotor cipher
3.16
3.2.2 Continued
Enigma Machine
Figure 3.20 A schematic of the Enigma machine
3.17
