Classical

Encryption
Techniques

DR FAISAL BASHIR
Cryptography
 Comes from Greek kryptós "hidden" and
gráfein "to write"

 The principles and methods of

transforming an intelligible message into
one that is unintelligible and
retransforming that message to its original
form at the other end.
Some Basic Terminology
 plaintext - original message
 ciphertext - coded message
 cipher - algorithm for transforming plaintext to
ciphertext
 key - info used in cipher known only to
sender/receiver
 encipher (encrypt) - converting plaintext to
ciphertext
 decipher (decrypt) - recovering ciphertext from
plaintext
 cryptography - study of encryption
principles/methods
 cryptanalysis (codebreaking) - study of
principles/ methods of deciphering ciphertext
without knowing key
 cryptology - field of both cryptography and
cryptanalysis
 Ciphers
 Symmetriccipher: same key used for
encryption and decryption
 Block cipher: encrypts a block of plaintext at
a time (typically 64 or 128 bits)
 Stream cipher: encrypts data one bit or one
byte at a time

 Asymmetric cipher: different keys used

for encryption and decryption
Symmetric Cipher Model
Symmetric Encryption
 or conventional / secret-key / single-key
 sender and recipient share a common
key
 all classical encryption algorithms are
symmetric
 The only type of ciphers prior to the
invention of asymmetric-key ciphers in
1970’s
 by far most widely used
Symmetric Encryption
 Mathematically:
Y = EK(X) or Y = E(K, X)
X = DK(Y) or X = D(K, Y)
X = plaintext
 Y = ciphertext
 K = secret key
 E = encryption algorithm
 D = decryption algorithm
 Both E and D are known to public
 Cryptography
 characterize cryptographic system by:
 type of encryption operations used
 substitution / transposition / product
 number of keys used
 single-key or private / two-key or public
 way in which plaintext is processed
 block / stream
Classical encryption operations
 Plaintext is viewed as a sequence of
elements (e.g., bits or characters)
 Substitution cipher: replacing each
element of the plaintext with another
element.
 Transposition (or permutation) cipher:
rearranging the order of the elements
of the plaintext.
 Product cipher: using multiple stages of
substitutions and transpositions
Cryptanalysis
 Objective: to recover the plaintext of a
ciphertext or, more typically, to
recover the secret key.
 Kerckhoff’s
principle: the adversary
knows all details about a
cryptosystem except the secret key.
 Two general approaches:
 brute-forceattack
 non-brute-force attack (cryptanalytic
attack)
 Brute-Force Attack
 Tryevery key to decipher the ciphertext.
 On average, need to try half of all possible keys
 Time needed proportional to size of key space

Key Size (bits) Number of Alternative Time required at 1 Time required at 106
Keys decryption/µs decryptions/µs
32 232 = 4.3  109 231 µs = 35.8 minutes 2.15 milliseconds

56 256 = 7.2  1016 255 µs = 1142 years 10.01 hours

128 2128 = 3.4  1038 2127 µs = 5.4  1024 years 5.4  1018 years

168 2168 = 3.7  1050 2167 µs = 5.9  1036 years 5.9  1030 years

26 characters 26! = 4  1026 2  1026 µs = 6.4  1012 years 6.4  106 years
(permutation)
 Cryptanalytic Attacks
 ciphertext only
 only knows algorithm & ciphertext
 known plaintext
 know/suspect plaintext & ciphertext
 chosen plaintext
 select plaintext and obtain ciphertext
 chosen ciphertext
 select ciphertext and obtain plaintext
Example: chosen-plaintext attack
 In 1942, US Navy cryptanalysts discovered
that Japan was planning an attack on “AF”.
 They believed that “AF” means Midway
island.
 Pentagon didn’t think so.
 US forces in Midway sent a plain message
that their freshwater supplies were low.
 Shortly, US intercepted a Japanese ciphertext
saying that “AF” was low on water.
 This proved that “AF” is Midway.
 More Definitions
 unconditional security
 no matter how much computer power or time is
available, the cipher cannot be broken since the
ciphertext provides insufficient information to uniquely
determine the corresponding plaintext
 computational security
 given limited computing resources (eg time needed
for calculations is greater than age of universe), the
cipher cannot be broken
 Cryptography - recap
characterize cryptographic system by:
 type of encryption operations used
substitution / transposition / product
 number of keys used
 single-key or private : symmetric
 two-key or public : Asymmetric
 way in which plaintext is processed
block / stream
Classical Substitution Ciphers
 Letters/bitsof plaintext are replaced by
other letters/bits.
 Categorized as:
 Monoalphabetic Ciphers – Simple Cipher
 Homophonic Ciphers
 Polyalphabetic Ciphers
 Polygram Ciphers
Mono-alphabetic cipher/ Simple
Substitution
 Substitution of single letters separately
 simple substitution—can be demonstrated by
writing out the alphabet in some order to
represent the substitution.
 This is termed a substitution alphabet.
 The cipher alphabet may be shifted or
reversed (creating the Caesar and Atbash
ciphers, respectively) or scrambled in a more
complex fashion, in which case it is called a
mixed alphabet or deranged alphabet.
 Caesar Cipher
 Earliestknown substitution cipher
 Invented by Julius Caesar
 Each letter is replaced by the letter three
positions further down the alphabet.

• Plain: a b c d e f g h i j k l m n o p q r s t u v w x y z
Cipher: D E F G H I J K L M N O P Q R S T U V W X Y Z A B C

 Example: Attack  Dwwdfn

Caesar Cipher
 Mathematically, map letters to
numbers:
a, b, c, ..., x, y, z
0, 1, 2, ..., 23, 24, 25
 Then the general Caesar cipher is:
c = EK(p) = (p + k) mod 26
p = DK(c) = (c – k) mod 26
 Canbe generalized with any
alphabet.
Cryptanalysis of Caesar Cipher
 Key space: {0, 1, ..., 25}
 Vulnerable to brute-force attacks.

 Need to recognize it when have the plaintext

 What if the plaintext is written in Korean or …?
Cryptanalysis of Caesar Cipher
 Brute-force attack is easily possible.
 Need to try just 25 keys.
 More Monoalphabetic Substitutions …

 Shuffle the letters and map each plaintext

letter to a different random ciphertext
letter:
Plain letters: abcdefghijklmnopqrstuvwxyz
Cipher letters: DKVQFIBJWPESCXHTMYAUOLRGZN

Plaintext: ifwewishtoreplaceletters
Ciphertext: WIRFRWAJUHYFTSDVFSFUUFYA
 Monoalphabetic Cipher - example

1) pt : larger key size means greater security

CT : WKJHV JUVZO DGVQV KNOHJ VKIVJ OVPXJ DIZ

2) CT: SVOIJ RZIFV UVZKI IFVVN SRMIF VOVOO DRN

pt : destroy the key at the end of the session
 Monoalphabetic Cipher Security

 What does a key look like?

 Now we have a total of 26! = 4 x 1026 keys.
 Withso many keys, it is secure against brute-force
attacks.
 But not secure against some cryptanalytic attacks.
 Problem is language characteristics.
Language Statistics and
Cryptanalysis
 Human languages are not random.
 Letters are not equally frequently used.
 In English, E is by far the most common
letter, followed by T, R, N, I, O, A, S.
 Other letters like Z, J, K, Q, X are fairly rare.
 There are tables of single, double & triple
letter frequencies for various languages
English Letter Frequencies
Statistics for double & triple
letters
 In decreasing order of frequency

 Double letters (Digram frequency):

th he an in er re es on, …

 Triple letters (Trigram frequency):

the and ent ion tio for nde, …
 Use in Cryptanalysis
 Key
concept: monoalphabetic substitution
does not change relative letter frequencies

 To attack, we
 calculate
letter frequencies for ciphertext
 compare this distribution against the known one
 Example Cryptanalysis
 Given ciphertext:
UZQSOVUOHXMOPVGPOZPEVSGZWSZOPFPESXUDBMETSXAIZ
VUEPHZHMDZSHZOWSFPAPPDTSVPQUZWYMXUZUHSX
EPYEPOPDZSZUFPOMBZWPFUPZHMDJUDTMOHMQ
 Count relative letter frequencies (next slide)
 Guess {P, Z} = {e, t}
 Of double letters, ZW has highest frequency,
so guess ZW = th and hence ZWP = the
 Proceeding with trial and error finally get:
it was disclosed yesterday that several informal but
direct contacts have been made with political
representatives of the viet cong in moscow
 Letter frequencies in ciphertext

P 13.33 H 5.83 F 3.33 B 1.67 C 0.00

Z 11.67 D 5.00 W 3.33 G 1.67 K 0.00
S 8.33 E 5.00 Q 2.50 Y 1.67 L 0.00
U 8.33 V 4.17 T 2.50 I 0.83 N 0.00
O 7.50 X 4.17 A 1.67 J 0.83 R 0.00
M 6.67
Classical Substitution Ciphers
 Letters/bitsof plaintext are replaced by
other letters/bits.
 Categorized as:
 Monoalphabetic Ciphers
 Homophonic Ciphers
 Polyalphabetic Ciphers
 Polygram Ciphers
Homophonic Ciphers
 Replacing each letter with a variety
of substitutes (homophones) where
a homophone is used in rotation or
chosen randomly.
 The number of potential substitutes
are proportional to the frequency of
the letter.
 Example
 pt:defending against
frequency analysis
attacks
 CT: 45 14 31 87 66 01 73
59 25 09 06 78 88 71 11
49 10 40 98 94 63 46 58
41 52 12 58 53 26 21 19
73 36 33 20 69 67 62 04
76
Analysis of Homophonic
Ciphers
 Usually, the highest-frequency plaintext
symbols are given more equivalents than
lower frequency letters. In this way, the
frequency distribution is flattened, making
analysis more difficult.
 Mongram frequencies are balanced off
but digram, trigram frequencies still persist.
 Example: Book Cipher, Beale cipher,
Straddling checkerboard
Book Cipher
 Traditionally book ciphers work by replacing
words in the plaintext of a message with the
location of words from the book being used. In
this mode, book ciphers are more properly called
codes.
 This can have problems; if a word appears in the
plaintext but not in the book, it cannot be
encoded.
 Possible solutions: Dictionary and Bible ciphers
 An alternative approach which gets around this
problem is to replace individual letters rather than
words. (e.g. Beale cipher)
Beale Cipher
 Book or text used for ciphering/deciphering:
United States Declaration of Independence.
 To decrypt writings of Beale, one finds the
word corresponding to the number (e.g., the
first number is 115, and the 115th word in the
Declaration of Independence is "instituted")
 Take the first letter of that word (in the case of
the example, "I").
 Note that this method of encryption is slightly
different from a standard book cipher.
Classical Substitution Ciphers

 Letters/bitsof plaintext are replaced by

other letters/bits.
 Categorized as:
 Monoalphabetic Ciphers – Simple Cipher
 Homophonic Ciphers
 Polyalphabetic Ciphers
 Polygram Ciphers
Polyalphabetic Ciphers
A plaintext letter maps to multiple
ciphertext letters.
 Multiple mono-alphabetic substitutions
are applied through the plaintext.
 A key defines which mono-alphabetic
substitution to apply.
Polyalphabetic Ciphers
 Polyalphabetic substitution ciphers were first
described in 1467 by Leone Battista Alberti in
the form of disks.
 In a polyalphabetic cipher, multiple cipher
alphabets are used. To facilitate encryption, all
the alphabets are usually written out in a large
table, usually 26×26.
 The method of filling the table, and of
choosing which alphabet to use next, defines
the particular polyalphabetic cipher.
 All such ciphers are easier to break than once
believed, as substitution alphabets are
repeated for sufficiently large plaintexts.
Polyalphabetic Ciphers
 One of the most popular was that of Blaise de
Vigenère. First published in 1585, it was
considered unbreakable until 1863.
(Commonly known by French as
"indecipherable cipher").
 The Gronsfeld cipher.
 The Beaufort cipher.
 The autokey cipher,
 The running key cipher
Vigenere Cipher
 Constitutesof 26 Caesar ciphers To
encrypt n plaintext letters:
 Ci = (pi + ki) mod 26; 1≤i≤n
 To decrypt n ciphertext letters:
 pi = (Ci - ki) mod 26; 1≤i≤n
 The key is of length d i.e. K = k1 k2 ... kd
 Use each key letter in turn.
 Repeat from k1 after d letters.
 Example
K : deceptive
 PT: we are discovered save yourself

d e c e p t i v e d e c e p t i v e d e c e p t i v e
K:
PT: w e a r e d i s c o v e r e d s a v e y o u r s e l f

CT: Z I C V T WQN GR Z GV T WA V Z H C QY GL MGJ

Example: Using the Vigenere
Table  To encrypt:

 Use ki for row

 Use pi for column
 Ci is the alphabet
at the
intersection.
 To decrypt:
 Use ki for row.
 Locate Ci in the
row, pi is the
alphabet at the
column top.
Analysis
 Monoalphabetic frequencies are distributed
 Encrypting one PT letter with different K letters
generates different CT letters.
 But encrypting same PT letter with the same K
letter generated the same CT letter.
 This phenomena is further exploited to reveal
the key length.
 Analysis
K: d e c e p t i v e d e c e p t i v e d e c e p T i v

w e a r e d i s c o v e r e d s a v e y o u r s e l
PT:
Z I C V T WQ N G R Z G V T WA V Z H C Q Y G L MG
CT:
1 2 3 4 5 6 7 8 9 10 11 12

 Two identical sequences of plaintext occurring at a

distance that is integer multiple of keyword length,
generate identical ciphertext sequences.
 Here, keyword length could be:
 3 or 9
Analysis
 Lets say, we have somehow determined the
keyword length as 9.
 This suggests using 9 monoalphabetic ciphers.
 PT at index 1, 10, 19, 28…. are encrypted with
one key.
 PT at index 2, 11, 20, 29…. are encrypted with
same key.
 And so on…
 Individual frequency analysis can be carried
out on the 9 ciphers.
Autokey or autoclave Cipher
 Thisis an extension of vigenere cipher.
 There are two forms of autokey cipher:
 A key-autokey cipher uses previous members of
the keystream to determine the next element in
the keystream.
 A text-autokey uses the previous message text
to determine the next element in the keystream.
to remove
 Plaintext:THIS IS A SECRET TEXT
Keyword: KEY
Key: KEYTHISISASECRETT
Encoded text: DLGLPASAWCJIVKIQM
 It can be used as a stream cipher
Vernam cipher and One-Time-Pad (OTP)
 The one-time pad, which is a provably secure
cryptosystem, was developed by Gilbert
Vernam in 1918.
 The message is represented as a binary string
(a sequence of 0’s and 1’s using a coding
mechanism such as ASCII coding.
 The key is a truly random sequence of 0’s and
1’s of the same length as the message.
 The encryption is done by adding the key to
the message modulo 2, bit by bit. This process
is often called exclusive or, and is denoted by
XOR.
 The symbol ⊕ is used.
Example - Vernam cipher
 message: 001011010111
 pad: 100111001011
 cipher: 1 0 1 1 0 0 0 1 1 1 0 0 (XOR)
 RECEIVING
 cipher: 101100011100
 pad: 1 0 0 1 1 1 0 0 1 0 1 1 (XOR)
 message: 0 0 1 0 1 1 0 1 0 1 1 1
 Analysis of OTP
 Given the CT:
 ANKYODKYUREPFJBYOJDSPLREYIUNOFDOIUERFPLUYT
 Lets suppose, the opponent managed to find K1 and
K2, both generating meaningful plaintexts for the same
CT.
 K1: pxlmvmsydofuyrvzwctnlebnecvgdupahfzzlmnyih
 PT1: mr mustard with the candlestick in the hall
AND
 K2: mfugpmiydgaxgoufhklllmhsqdqogtewbqfgyovuhwt
 PT2: miss scarlet with the knife in the library
 Which one is the correct key?
 Since both are truly random, so attacker cannot say
which one is more likely than the other.
Analyis of OTP
 To encrypt n plaintext bits:
 Ci = (pi  ki) 1≤i≤n
 To decrypt n ciphertext bits:
 pi = (Ci  ki) 1≤i≤n
 Thereis no statistical relationship between
the CT and PT now.
 Generating large quantities of random keys
 Secure key distribution and storage
 OTP is used in many modern cipher
especially stream ciphers such as RC4
 Rotor Cipher Machines
 Also known as Mechanical Cipher. It is polyalphabetic cipher
in its basic form.
 Before modern ciphers, rotor machines were most common
complex ciphers in use.
 Widely used during 1930 to 1960 especially in WW2.
Mechanical ciphers were first patented in 1919.
 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?
 If the adversary has a machine
 If the adversary doesn’t have a machine
57
The Rotors

58
Enigma Rotor Machine

59
60
 German secret setting sheets

Date
Which rotors to use (there were 10 rotors)
Ring setting
Plugboard setting
61
Classical Substitution Ciphers

 Letters/bitsof plaintext are replaced by

other letters/bits.
 Categorized as:
 Monoalphabetic Ciphers – Simple Cipher
 Homophonic Ciphers
 Polyalphabetic Ciphers
 Polygram Ciphers
Polygram Ciphers
 In a polygraphic substitution cipher, plaintext
letters are substituted in larger groups, instead
of substituting letters individually.
 Encrypt multiple letters at a time.
 The first advantage is that the frequency
distribution is much flatter than that of
individual letters
 Second, the larger number of symbols requires
correspondingly more ciphertext to
productively analyze letter frequencies.
 The Playfair Cipher is the best known such
cipher. Widely used from 1860 to 1960.
 Playfair Key Matrix
 Use a 5 x 5 matrix.
 Fill in letters of the key (w/o duplicates).
 Fill the rest of matrix with other letters.
 E.g., key = MONARCHY.

M O N A R
C H Y B D
E F G I/J K
L P Q S T
U V W X Z

65
 http://en.wikipedia.org/wiki/Playfair_ciphe

Example
Key: playfair example
 Message: Hide the gold in the tree stump
 Digraph: HI DE TH EG OL DI NT HE TR EX ES TU MP
 Encrypted Message: BMODZBXDNABEKUDMUIXMMOUVIF
 Encrypting and Decrypting
Plaintext is encrypted two letters at a time.
1. If a pair is a repeated letter, insert filler like 'X’.
2. If both letters fall in the same row, replace each with
the letter to its right (circularly).
3. If both letters fall in the same column, replace each
with the the letter below it (circularly).
4. Otherwise, each letter is replaced by the letter in the
same row but in the column of the other letter of the
pair.

70
Security of Playfair Cipher
 Security
is much improved over the simple
monoalphabetic cipher.
 Was widely used for many decades
 eg. by US & British military in WW1 and early
WW2
 Once thought to be unbreakable.
 Actually,
it can be broken, because it still
leaves some structure of plaintext intact.

71
PlayFair - Example
 Key: Black Cat
 Plain Text: Attack at dawn while they are
sleeping

 Cipher Text: ?
Classical Transposition Ciphers
 Permutation of the plaintext letters.
 Hide the message by rearranging the letter
order without altering the actual letters
used.
 Rail Fence Cipher
 Route cipher
 Columnar Transposition Cipher
 Grille
Rail Fence Cipher
 Plaintext is written down as a sequence of
diagonals and read off as a sequence of
rows.
 E.g. the PT: meet me after the party, is
written using a rail fence of depth 2 as:
m e m a t r h t g p r y
e t e f e t e o a a t

 CT: MEMATRHTGPRYETEFETEOAAT
Rail Fence Cipher
 Plain
Text: WE ARE DISCOVERED. FLEE AT
ONCE

http://en.wikipedia.org/wiki/Transposition_cipher
Route Cipher
 In a route cipher, the plaintext is first written
out in a grid of given dimensions, then read
off in a pattern given in the key.
 Route ciphers have many more keys than a
rail fence. In fact, for messages of reasonable
length, the number of possible keys is
potentially too great to be enumerated even
by modern machinery.
 However, not all keys are equally good. Badly
chosen routes will leave excessive chunks of
plaintext, or text simply reversed, and this will
give cryptanalysts a clue as to the routes.
Route Cipher

http://en.wikipedia.org/wiki/Transposition_cipher
Columnar Transposition Cipher
 In a columnar transposition, the message is
written out in rows of a fixed length, and then
read out again column by column, and the
columns are chosen in some scrambled order.
 Both the width of the rows and the
permutation of the columns are usually
defined by a keyword.
 For example, the word ZEBRAS is of length 6
(so the columns are of length 6), and the
permutation is defined by the alphabetical
order of the letters in the keyword. In this case,
the order would be "6 3 2 4 1 5"
Columnar Transposition Cipher
 Write the message row-wise.
 Read the message column-wise, in some specific
order.
 For example:
Plaintext: Attack Postponed until two am
Ciphertext: TTNAAPTMTSUOAODWCOIXKNLYPETZ
Key: 4312567 or DCABEFG
Column length is specified by first number in key.

4 3 1 2 5 6 7
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
Analysis of columnar transposition
 Simple transposition can be easily detected
by doing a frequency count.
 Can be attacked by anagramming
(rearranging).
 Also keys very close to the correct key will reveal
long sections of legible plaintext interspersed by
gibberish.
 Can be more secure if multiple stages of
transposition, using multiple keys, are
performed.
 Double columnar transposition is more secure
and is similar to single columnar transposition,
but the process is repeated twice.
Grille
 A grille usually consists of a square piece of
cardboard with cut-out apertures.
 The grille is placed on a piece of paper, and the
corners of the grille are marked on the paper.
Then, the plaintext is written, letter by letter in the
apertures of the grille.
 When the last aperture is reached, the grille is
turned 90 degrees, and the process continued. If
the apertures are properly placed on the grille,
turning the grille through all four positions (i.e. 0
degrees, 90 degrees, 180 degrees, and 270
degrees) will not result in any aperture appearing
in a position where a letter has already been
written on the paper.
  PT:
We need more machine gun
Grille ammunition fast xx

http://hem.passagen.se/tan01/transpo.html
Classical Product Ciphers and
Fractioning Systems
Product Cipher
 two substitutions are really only one more
complex substitution
 two transpositions are really only one more
complex transposition
 but a substitution followed by a transposition
makes a new much harder cipher (Product
Cipher)
 Fractioning
 Transposition is particularly effective when employed
with fractionation
 In a fractionation system, a substitution is first made
from symbols in the plaintext to multiple symbols in the
ciphertext, which is then super encrypted by a
transposition.
 For example, the plaintext alphabet could be written
out in a grid, then every letter in the message replaced
by its co-ordinates (Polybius square and Straddling
checkerboard).
 When such a fractionated message is transposed, the
components of individual letters become widely
separated in the message.
 Examples of ciphers that combine fractionation and
transposition include the bifid cipher, the trifid cipher,
the ADFGVX cipher and the VIC cipher.
Polybius Square

 Each letter is represented

by its coordinates in the
grid. For example, "BAT"
becomes "12 11 44".
Because 26 characters do
not quite fit in a square, it is
rounded down to the next
lowest square number by
combining two letters
(usually I and J).
ADFGVX Cipher
 Named since only letters ADFGVX are used
 Used by the German's and broken by the
English in WW1
 uses a fixed substitution table for fractioning
to map each plaintext letter to a letter pair
(row-col index)
 then uses a keyed block transposition to split
letter pairs up
 ciphertext is then written in blocks and sent
ADFGVX Cipher - Example
 Suppose we need to send the plaintext message,
"Attack at once". First, a secret mixed alphabet is
filled into a 5 × 5 Polybius square, like so:

i and j have been combined, to

make the alphabet fit into a 5 × 5
grid.

Using this square, the message is

converted to fractionated form:

http://en.wikipedia.org/wiki/ADFGVX_cipher
 ADFGVX Cipher - Example
 Next, the fractionated message is subject to a
columnar transposition. We write out the message in
rows under a transposition key (here, "CARGO"):
Next, we sort the letters alphabetically in
the transposition key (changing CARGO
to ACGOR), rearranging the columns
beneath the letters along with the letters
themselves:

Cipher Text: FAXDF ADDDG DGFFF AFAXX AFAFX

 Bifid Cipher

http://en.wikipedia.org/wiki/Bifid_cipher
 Bifid Cipher - Exercise
Cipher Text: odstsn sdml tsqg ia apkd dhmod ybf
pdamdf fmot qfv nrywyvrg wyxerxz tbq noipxugobb
ni vwe Kuvle

Key: HolyBook

Plain Text: hearts rust just as iron rusts and indeed they are
polished through the recitation of the Quran
Bifid Cipher – Quiz (8A)
 Cipher Text: Ei to tet ttgez do tbwtes
rpg ztpl tvu fap outkes

 Key: Behind the door

 Plain Text: ?

It is too later to attack now wait for new

orders
Bifid Cipher – Quiz (7A)
 CipherText: Skcu ree snuy gb k
foben dfi fbl dnid elru chfpuslh

 Key: You are not alone

 Plain Text: ?

Wait for Dawn on a sunny day. Hit with full

strength.
Homework
 VIC or VICTOR Cipher
 Hill Cipher
 Bifid Cipher
 Trifid Cipher
Quiz -1 (10 marks)
 Cipher
Text: FAFD DGAD XDFX AAAF FGDA
GFDD AAGX GAGD GAAG GAXF FDFF FFAF
ADFD FAFA GFDA XXXX

 Substitution
key: the only one
 Permutation key: trunckax

 Decipher
the above mentioned text using
ADFGVX algorithm.