POLYALPHABETIC CIPHERS

AUTOKEY CIPHER

 ideally want a key as long as the message

 Vigenère proposed the autokey cipher
 with keyword is prefixed to message as key
 knowing keyword can recover the first few letters
 use these in turn on the rest of the message
 but still have frequency characteristics to attack
 eg. given key deceptive
key: deceptivewearediscoveredsav
plaintext: wearediscoveredsaveyourself
ciphertext:ZICVTWQNGKZEIIGASXSTSLVVWLA
 ONE-TIME PAD

 if a truly random key as long as the message is used, the cipher will be secure
called a One-Time pad
 is unbreakable since ciphertext bears no statistical relationship to the plaintext
 since for any plaintext & any ciphertext there exists a key mapping one to other
 can only use the key once though
 have problem of safe distribution of key
ONE-TIME PAD

Vernam’s one-time pad cipher

 Key = k1k2k3k4  (random, used one-time only)

 Plaintext = m1m2m3m4 

 Ciphertext = c1c2c3c4 
where ci  mi  ki

 Can be proved to be unconditionally secure.

4
TRANSPOSITION CIPHERS

 Also called permutation ciphers.

 Shuffle the plaintext, without altering the actual letters used.

 Example: Row Transposition Ciphers, Column
Transposition Ciphers

5
 ROW TRANSPOSITION CIPHERS

 Plaintext is written row by row in a rectangle.

 Ciphertext: write out the columns in an order specified by a key.Key: 3

421567
a t t a c k p
o s t p o n e
Plaintext:
d u n t i l t
wo a mx y z
Ciphertext: TTNAAPTMTSUOAODWCOIXKNLYPETZ 6
COLUMN TRANSPOSITION - RAIL FENCE
CIPHER

 write message letters out diagonally over a number of rows

 then read off cipher row by row
 eg. write message out as:

m e m a t r h t g p r y
e t e f e t e o a a t
 giving ciphertext
MEMATRHTGPRYETEFETEOAAT
PERMUTATION CIPHER

 Class of Transposition Cipher

 i.e: Encode the plaintext by changing the arrangement of
letters
 Block Cipher
 Uses a permutation of the plaintext to get ciphertext
ENCRYPTION & DECRYPTION

 Divide plaintext into blocks of length m

 Use a permutation of order m to get ciphertext

 Decryption is by the usage of the inverse of permutation in the ciphertext

PERMUTATION/TRANSPOSITION

 Permuting the plaintext is another type of cipher technique; also

referred to as transposition.
 Take the input, rearrange the output in a specific way.
 E.g., by writing the letters in a rectangle
``````` 1
3 2 4 5 6 7 8
t h e l a u n c
h c o d e i s i
n t h e d e s k
= thh eoh hct lde aed uie nss cik
 Using the technique simply is weak as it preserves the frequencies
of the letters.
CRYPTANALYSIS
CRYPTANALYSIS
PRODUCT CIPHERS

 Uses a sequence of substitutions and transpositions

 Harder to break than just substitutions or transpositions

 This is a bridge from classical to modern ciphers.

13
 UNCONDITIONAL & COMPUTATIONAL SECURITY

 A cipher is unconditionally secure if it is secure no matter how

much resources (time, space) the attacker has.
 A cipher is computationally secure if the best algorithm for
breaking it will require so much resources (e.g., 1000 years)
that practically the cryptosystem is secure.
 All the ciphers we have examined are not unconditionally
secure.

14
ROTOR CIPHER MACHINES

 Before modern ciphers, rotor machines were most common complex

ciphers in use.
 Widely used in WW2.

 Used a series of rotating cylinders.

 Implemented a polyalphabetic substitution cipher of period K.

 With 3 cylinders, K = 263 =17,576.

 With 5 cylinders, K = 265 =12 x 106.

 What is a key?
15
 If the adversary has a machine
 If the adversary doesn’t have a machine
16
THE ROTORS

17
ENIGMA ROTOR MACHINE

18
ENIGMA ROTOR MACHINE

19
Queries?