Vignere Solved Example
Vignere Solved Example
• Interim Ciphertext
• GREENGRE is the interim cipher-text
Vigenère Cipher - Encryption
• 1. Take the letter of the plain-text and go
through the corresponding column in
Vigenere table.
• 2. Take the letter of the interim cipher-text
and go through the corresponding row in
Vigenere table.
• 3. The letter at the intersection of the above
two is cipher letter.
• 4. In our example it is VROMFZRR.
Vigenère Encryption
Vigenère Encryption
Vigenère Encryption
Vigenère Cipher - Encryption
• In our example After going through whole
plaintext PAKISTAN, and interim ciphertext
GREENGRE our cipher text will be
VROMFZRR
Vigenère Encryption - Decryption
• Go through the row in the table corresponding
to key and finding the position of the cipher-
text letter in this row
• Use the column label as plain-text.
Security of Vigenère Ciphers
• have multiple ciphertext letters for each
plaintext letter hence letter frequencies are
obscured but not totally lost
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
Transposition Ciphers
• now consider classical transposition or
permutation ciphers
• these hide the message by rearranging the
letter order
• without altering the actual letters used
• can recognise these since have the same
frequency distribution as the original text
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 with key=2:
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
To decipher a rail fence
… cipher, we divide
the ciphertext in half and reverse the
order of the steps of encipherment, that
is, write the ciphertext in two rows and
read off the plaintext in a zig-zag fashion.
MEMATRHTGPRYETEFETEOAAT
• MEMATRHTGPRY
• ETEFETEOAAT
(Note that if there are an odd number of letters,
we include the “middle” letter on the top
line.)
Row Transposition Ciphers
• a more complex scheme
• write letters of message out in rows over a
specified number of columns
• then reorder the columns according to some
key before reading off the rows
Key: 3 4 2 1 5 6 7
Plaintext: a t t a c k p
o s t p o n e
d u n t i l t
w o a m x y z
Ciphertext: APTMTTNAAODWTSUOCOIXKNLYPETZ
Combination of Substitution &
Transposition Ciphers
• ciphers using substitutions or transpositions are not
secure because of language characteristics
• hence consider using several ciphers in succession to
make harder, but:
– two substitutions make a more complex substitution
– two transpositions make more complex transposition
– but a substitution followed by a transposition makes a new
much harder cipher
• this is bridge from classical to modern ciphers