Cryptography and

Network Security
(BTIT13502)
Module 02 : Classical Encryption Techniques
 Symmetric Cipher Model (Conventional Encryption)
Secret key shared by Secret key shared by
sender and recipient sender and recipient
K K
Transmitted
cipher text
Y = E(K, X)
X X
Plaintext Encryption Algorithm Decryption Algorithm Plaintext
input (e.g. AES) (reverse of encryption output
algorithm)

Module 02 : Classical Encryption Techniques 2

  An original message is known as the plaintext, while the coded
message is called the ciphertext.
 The process of converting from plaintext to ciphertext is known as
enciphering or encryption; restoring the plaintext from the
ciphertext is deciphering or decryption.

 Plaintext is the original intelligible message or data that is fed into

the algorithm as input.
 Encryption algorithm performs various substitutions and
transformations on the plaintext.

 Decryption algorithm is essentially the encryption algorithm run in

reverse.
 It takes the ciphertext and the secret key and produces the original
plaintext.

Module 02 : Classical Encryption Techniques 3

  Ciphertext is the scrambled message produced as output.
 It depends on the plaintext and the secret key.
 The ciphertext is an apparently random stream of data and, as it
stands, is unintelligible.

 The secret key is also input to the encryption algorithm.

 The key is a value independent of the plaintext and of the
algorithm.
 The algorithm will produce a different output depending on the
specific key being used at the time.

Module 02 : Classical Encryption Techniques 4

 Terminology
 Plaintext: original message
 Ciphertext: encrypted or coded message
 Encryption: convert from plaintext to ciphertext (enciphering)
 Decryption: restore the plaintext from ciphertext (deciphering)
 Key: information used in cipher known only to sender/receiver
 Cipher: a particular algorithm (cryptographic system)
 Cryptography: study of algorithms used for encryption
 Cryptanalysis: study of techniques used for decryption without
knowledge of plaintext
 Cryptology: areas of cryptography and cryptanalysis

Module 02 : Classical Encryption Techniques 5

 Cryptography and Cryptanalysis
 Cryptography(Secret Writing) is the process of protecting
information by transforming it into a secure (unreadable) format.

Hello Cryptography $!dzx

 Cryptanalysis is the decryption and analysis of encrypted text.

Cryptanalysis uses mathematical formulas to search algorithm
vulnerabilities and break into cryptography.

$!dzx Cryptanalysis Hello

Module 02 : Classical Encryption Techniques 6

 An opponent, observing Y but not having access to K or X, may
attempt to recover X or K or both X and K.
 If the opponent is interested in only this particular message, then
he will focus to recover X by generating a plaintext estimate 𝑋.෠
 Often, however, the opponent is interested in being able to read
future messages as well, in which case an attempt is made to
recover K by generating an estimate 𝐾. ෡
 Requirements and Assumptions
 Requirements for secure use of symmetric encryption:
1. Strong encryption algorithm: Given the algorithm and cipher text,
an attacker cannot obtain key or plaintext.
2. Shared secret keys: sender and receiver both have shared a
secret key; no-one else knows the key(keep it secret).
 Assumptions:
 Cipher is known
 Secure channel to distribute keys

Module 02 : Classical Encryption Techniques 8

 Substitution Techniques
 A substitution technique is one in which the letters of plaintext are
replaced by other letters or by numbers or symbols.
 If plaintext viewed as sequence of bits, replace plaintext bit
patterns with ciphertext bit patterns.
1. Caesar Cipher
2. Monoalphabetic Cipher
3. Playfair Cipher
4. Hill Cipher
5. Polyalphabetic Ciphers
6. One-Time Pad

Module 02 : Classical Encryption Techniques 9

 1. Caesar Cipher
 The Caesar Cipher involves replacing each letter of the alphabet
with the letter standing three places further down the alphabet.
 For encryption algorithm is:

C = E(3, P) = (P + 3) mod 26
 For decryption algorithm is:

P = D(3, C) = (C - 3) mod 26

Module 02 : Classical Encryption Techniques 10

 Caesar Cipher (Cont…)
 Let us assign a numerical equivalent to each letter
a b c d e f g h i j k l m
0 1 2 3 4 5 6 7 8 9 10 11 12
n o p q r s t u v w x y z
13 14 15 16 17 18 19 20 21 22 23 24 25

C = E(3, P) = (P + 3) mod 26
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:
Plaintext: THE QUICK BROWN FOX
Ciphertext: WKH TXLFN EURZQ IRA

Module 02 : Classical Encryption Techniques 11

 Caesar Cipher (Cont…)
 Generalised Caesar Cipher
• Allow shift by k positions.
• Encryption : C = E(K, P) = (P + K) mod 26

• Decryption : P = D(K, C) = (C - K) mod 26

Module 02 : Classical Encryption Techniques 12

 Caesar Cipher Examples
1. Plaintext: networksecurity 2. Cipher: exxegoexsrgi
Key: 7 Key: 4
Cipher: uladvyrzljbypaf Plaintext : attackatonce
3. Cipher: kyzj dvjjrxv zj vetipgkvu
Key: 17
Plain: this message is encrypted
4. Plain: information security
Key: l
Cipher: tyqzcxletzy dpnfctej

Module 02 : Classical Encryption Techniques 13

 Brute force attack on Caesar Cipher
 The encryption and decryption algorithms are known.
 There are only 25 keys to try, e.g. k=1, k=2, …
 The language of the plaintext is known and easily recognizable.

Module 02 : Classical Encryption Techniques 14

 Brute force attack on Caesar Cipher
Ciphertext: ZNK WAOIQ HXUCT LUD
Key Transformed text Key Transformed text
1 YMJ VZNHP GWTBS KTC 14 LZW IMAUC TJGOF XGP
2 XLI UYMGO FVSAR JSB 15 KYV HLZTB SIFNE WFO
3 WKH TXLFN EURZQ IRA 16 JXU GKYSA RHEMD VEN
4 VJG SWKEM DTQYP HQZ 17 IWT FJXRZ QGDLC UDM
5 UIF RVJDL CSPXOGPY
18 HVS EIWQY PFCKB TCL
6 THE QUICK BROWN FOX
19 GUR DHVPX OEBJA SBK
7 SGD PTHBJ AQNVM ENW
8 RFC OSGAI ZPMUL DMV 20 FTQ CGUOW NDAIZ RAJ
9 QEB NRFZH YOLTK CLU 21 ESP BFTNV MCZHY QZI
10 PDA MQEYG XNKSJ BKT 22 DRO AESMU LBYGX PYH
11 OCZ LPDXF WMJRI AJS 23 CQN ZDRLT KAXFW OXG
12 NBY KOCWE VLIQH ZIR 24 BPM YCQKS JZWEV NWF
13 MAX JNBVD UKHPG YHQ 25 AOL XBPJR IYVDU MVE
Module 02 : Classical Encryption Techniques 15
 Substitution Techniques
1. Caesar Cipher
2. Monoalphabetic Cipher
3. Playfair Cipher
4. Hill Cipher
5. Polyalphabetic Ciphers
6. One-Time Pad

Module 02 : Classical Encryption Techniques 16

 2. Monoalphabetic Cipher (Simple substitution)
 It is an improvement to the Caesar Cipher.
 Instead of shifting the alphabets by some number, this scheme
uses some permutation of the letters in alphabet.
 Use a single alphabet for both plaintext and cipher text.
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: y n l k x b s h m i w d p j r o q v f e a u g t z c
Example:
 Cipher: kxlvzoemrj
 Plaintext: decryption
 Try Brute force attack :
• With 26 letters in alphabet, the possible permutations are 26!
Keys (>4x1026)

Module 02 : Classical Encryption Techniques 17

Module 02 : Classical Encryption Techniques 18
 Attack on Monoalphabetic Cipher
 The relative frequencies of the letters in the ciphertext (in %) are

Ciphertext:
uzqsovuohxmopvgpozpevsgzwszopfpesxudbmetsxaizvuephzhmdzshz
owsfpappdtsvpquzwymxuzuhsxepyepopdzszufpombzwpfupzhmdjudtm
ohmq
 In our ciphertext, the most common digram is ZW, which appears
three times. So equate Z with t, W with h and P with e.
 Now notice that the sequence ZWP appears in the ciphertext, and
we can translate that sequence as “the.”
Module 02 : Classical Encryption Techniques 19
 Attack on Monoalphabetic Cipher (Cont…)
 If the cryptanalyst knows the nature of the plaintext, then the
analyst can exploit the regularities of the language.
 The relative frequency of the letters can be determined and
compared to a standard frequency distribution for English.
 If the message were long enough, this technique alone might be
sufficient, but because this is a relatively short message, we
cannot expect an exact match.

Module 02 : Classical Encryption Techniques 20

 Substitution Techniques
1. Caesar Cipher
2. Monoalphabetic Cipher
3. Playfair Cipher
4. Hill Cipher
5. Polyalphabetic Ciphers
6. One-Time Pad

Module 02 : Classical Encryption Techniques 21

 3. Playfair Cipher
 The Playfair algorithm is based on a 5 × 5 matrix (key) of letters.
 The matrix is constructed by filling in the letters of the keyword
(minus duplicates) from left to right and from top to bottom, and
then filling in the remainder of the matrix with the remaining
letters in alphabetic order. The letters I and J count as one letter.

O C U R E
Example: N A B D F
Keyword= OCCURRENCE
Plaintext= TALL TREES G H I/J K L
M P Q S T
V W X Y Z

Module 02 : Classical Encryption Techniques 22

 Playfair Cipher - Encrypt Plaintext
 Operate on pair of letters (digram) at a time.
 Special: if digram with same letters appears, separate by special
letter (e.g. x)
Plaintext= TALL TREES
Plaintext= TA LX LT RE ES
 If there is an odd number of letters, then add uncommon letter to
complete digram, a X/Z may be added to the last letter.
Plaintext= NETWORK
Plaintext= NE TW OR KX

Module 02 : Classical Encryption Techniques 23

 Playfair Cipher - Encrypt Plaintext
 Map each pair in key matrix
O C U R E
Plaintext: TA LX LT RE ES
Ciphertext: PF IZ TZ EO RT N A B D F
G H I/J K L
M P Q S T
V W X Y Z
 If the
theletters
the lettersare
letters on different
appear
appear ononthe rows
thesame
sameand columns,
column,
row, replace
replace
replace themthem
them withwith
with the
the letters
letters on other
toimmediately
their corner
immediate of
below, the
right same row.
wrapping
respectively,
around
wrapping
to thearound
top to
if
 The
the order
necessary.
left sideisofimportant - the first letter of the pair should be
the row if necessary.
 replaced
For example,first. using the table above,
above, the
the letter
letter pair
pair RE
LT would be
 For example,
encoded TZ.using the table above, the letter pair TA would be
as EO.
encoded as PF.
Module 02 : Classical Encryption Techniques 24
 Playfair Cipher - Is it Breakable?
 Better than monoalphabetic: relative frequency of digrams much
less than of individual letters.
 But relatively easy (digrams, trigrams, expected words)

Module 02 : Classical Encryption Techniques 25

 Playfair Cipher Examples
1. Key= “engineering ” Plaintext= “test this process ”
2. Key= “keyword ” Plaintext= “come to the window”
3. Key= “moonmission ” Plaintext= “greet ”

Module 02 : Classical Encryption Techniques 26

 Playfair Cipher Examples
1. Key= “engineering ” Plaintext= “test this process ”
2. Key= “keyword ” Plaintext= “come to the window”
3. Key= “moonmission ” Plaintext= “greet ”
E N G I R Encrypted Message: K E Y W O Encrypted Message:
A B C D F pi tu pm gt ue R D A B C Lc nk zk vf yo
H K L M O lf gp xg F G H I L gq ce bw
P Q S T U M N P Q S
V W X Y Z T U V X Z
M O N I S Encrypted Message:
A B C D E hq cz du
F G H K L
P Q R T U
V W X Y Z

Module 02 : Classical Encryption Techniques 27

 Playfair Cipher Examples
4. Key: EXAMPLE
Ciphertext: UA ARBED EXAPO PR QNX AXANR
E X A M P
L B C D F
G H I/J K N
O Q R S T
U V W Y Z

Pair: UA AR BE DE XA PO PR QN XA XA NR
Plaintext: we wi lx lm ex et at th ex ex it
Plaintext: we wilxl mexet at thex exit
Plaintext: we will meet at the exit

Module 02 : Classical Encryption Techniques 28

 Substitution Techniques
1. Caesar Cipher
2. Monoalphabetic Cipher
3. Playfair Cipher
4. Hill Cipher
5. Polyalphabetic Ciphers
6. One-Time Pad

Module 02 : Classical Encryption Techniques 29

 4. Hill Cipher
 Hill cipher is based on linear algebra
 Each letter is represented by numbers from 0 to 25 and
calculations are done using modulo 26.
 Encryption and decryption can be given by the following formula:
Encryption: C=PK mod 26

Decryption: P=CK-1 mod 26

𝑘11 𝑘12 𝑘13

𝑐1 𝑐2 𝑐3 = 𝑝1 𝑝2 𝑝3 𝑘21 𝑘22 𝑘23 mod 26
𝑘31 𝑘32 𝑘33

Module 02 : Classical Encryption Techniques 30

 Hill Cipher Encryption
 To encrypt a message using the Hill Cipher we must first turn our
keyword and plaintext into a matrix (a 2 x 2 matrix or a 3 x 3
matrix, etc).
Example: Key = “HILL”, Plaintext = “EXAM”
a b c d e f g h i j k l m
0 1 2 3 4 5 6 7 8 9 10 11 12
n o p q r s t u v w x y z
13 14 15 16 17 18 19 20 21 22 23 24 25

H I 7 8
Key Matrix =
L L 11 11
E A 4 0
Plaintext =
X M 23 12
Module 02 : Classical Encryption Techniques 31
 Hill Cipher Encryption (Cont…)
H I 7 8 E A 4 0
Key Matrix = = Plaintext =
L L 11 11 X M 23 12
C=PK mod 26
7 8 4 7 8 0
11 11 23 11 11 12
7 x 4 + 8 x 23 = 212 7 x 0 + 8 x 12 = 96
11 x 4 + 11 x 23 = 297 11 x 0 + 11 x 12 = 132
7 8 4 212 7 8 0 96
= =
11 11 23 297 11 11 12 132
212 4 E 96 18 S
= mod 26 = = mod 26 =
297 11 L 132 2 C
Ciphertext = “ELSC”
Module 02 : Classical Encryption Techniques 32
 Hill Cipher Decryption
P=CK-1 mod 26
Step 1: Find Inverse of key matrix
Step 2: Multiply the Multiplicative Inverse of the Determinant by the
Adjoin Matrix
Step 3: Multiply inverse key matrix with ciphertext matrix to obtain
plaintext matrix

Module 02 : Classical Encryption Techniques 33

 Step 1: Inverse of key matrix
2 X 2 inverse of matrix
−1 1
a b d −b
=
c d ad − cb −c a

3 X 3 inverse of matrix
1
A−1 = ∙ adjoin(A)
determinant(A)

Module 02 : Classical Encryption Techniques 34

 Step 1: Inverse of key matrix
−1 1
7 8 11 −8
Inverse Key Matrix = =
11 11 77 − 88 −11 7
1 11 −8
=
−11 −11 7
 -11 mod 26 = 15
1 11 18  Because, modulo for negative
= mod 26
15 15 7 number is = N- (B%N)
= 26 – (11%26)

Module 02 : Classical Encryption Techniques 35

 Step 2: Modular (Multiplicative) inverse
 The inverse of a number A is 1/A since A * 1/A = 1
e.g. the inverse of 5 is 1/5
 In modular arithmetic we do not have a division operation.
 The modular inverse of A (mod C) is A-1
 (A * A-1) ≡ 1 (mod C)
Example:
 The modular inverse of A mod C is the B value that makes
A * A-1 mod C = 1
A = 3, C = 11
Since (3*4) mod 11 = 1, 4 is modulo inverse of 3
A = 10, C = 17 , A-1 = ?12

Module 02 : Classical Encryption Techniques 36

 Step 2: Modular (Multiplicative) inverse
Determinants’ multiplicative inverse Modulo 26

Determinant 1 3 5 7 9 11 15 17 19 21 23 25

Inverse Modulo 26 1 9 21 15 3 19 7 23 11 5 17 25

1 11 18
= mod 26
15 15 7
1
 Multiplicative inverse of is 7
15

Module 02 : Classical Encryption Techniques 37

 Step 2: Multiply with adjoin of matrix
11 18 77 126 25 22
=7 = mod 26 =
15 7 105 49 1 23

7 8 25 22
= thus, if K = then K −1 =
11 11 1 23

Module 02 : Classical Encryption Techniques 38

 Hill Cipher Encryption (Cont…)
25 22 E S 4 18
Inverse Key Matrix = Ciphertext =
1 23 L C 11 2
P=CK-1 mod 26
25 22 4 25 22 18
1 23 11 1 23 2
25 x 4 + 22 x 11 = 342 25 x 18 + 22 x 2 = 494
1 x 4 + 23 x 11 = 257 1 x 18 + 23 x 2 = 64
25 22 4 342 7 8 0 494
= =
1 23 11 257 11 11 12 64
342 4 E 494 0 A
= mod 26 = = mod 26 =
257 23 X 64 12 M
Plaintext = “EXAM”
Module 02 : Classical Encryption Techniques 39
 Hill Cipher Examples
1. Key: Hill Plaintext: short example
Ciphertext: APADJ TFTWLFJ
2. Key: ACBA Plaintext: DR GREER ROCKS (A=1, B=2, … )
Ciphertext: FZIFTOTBXGPO
3. Key:DACB Ciphertext: SAKNOXAOJ (A=1,B=2,…)
Plaintext: WELOVEMATH

Module 02 : Classical Encryption Techniques 40

 Substitution Techniques
1. Caesar Cipher
2. Monoalphabetic Cipher
3. Playfair Cipher
4. Hill Cipher
5. Polyalphabetic Ciphers
6. One-Time Pad

Module 02 : Classical Encryption Techniques 41

 5. Polyalphabetic Cipher
 Monoalphabetic cipher encoded using only one fixed alphabet
 Polyalphabetic cipher is a substitution cipher in which the cipher
alphabet for the plain alphabet may be different at different
places during the encryption process.
1. Vigenere cipher
2. Vernam cipher

Module 02 : Classical Encryption Techniques 42

 Plaintext

K
e
y

PT = HELLO
KEY = GMGMG
CT = NQRXU
 Vigenere Cipher
Keyword : DECEPTIVE Key must be as
Key : DECEPTIVEDECEPTIVEDECEPTIVE long as plaintext
else repeat a
Plaintext : WEAREDISCOVEREDSAVEYOURSELF keyword
Ciphertext : ZICVTWQNGRZGVTWAVZHCQYGLMGJ
C = P1 + K1 , P2 + K 2 , … Pm + K m mod 26
P = C1 − K1 , C2 − K 2 , … Cm − K m mod 26

An analyst looking at only the ciphertext would detect the repeated

sequences VTW at a displacement of 9 and make the assumption that the
keyword is either three or nine letters in length.
This system is
Keyword : DECEPTIVE referred as an
Key : DECEPTIVEWEAREDISCOVEREDSAV auto key
Plaintext : WEAREDISCOVEREDSAVEYOURSELF system
Module 02 : Classical Encryption Techniques 44
 Vigenere Cipher
 Multiple ciphertext letters for each plaintext letter.
 Weakness is repeating, structured keyword.
 Example:
 Plaintext: internet technologies
 Key: cryptography
 Cipher using standard algorithm: kertkbkk ttjfpfjdzm
 Cipher using auto key system: kertkbkk ttjfvbesxl

Module 02 : Classical Encryption Techniques 45

 Vernam Cipher
 The ciphertext is generated by applying the logical XOR operation
to the individual bits of plaintext and the key stream.

Module 02 : Classical Encryption Techniques 46

 Substitution Techniques
1. Caesar Cipher
2. Monoalphabetic Cipher
3. Playfair Cipher
4. Hill Cipher
5. Polyalphabetic Ciphers
6. One-Time Pad

Module 02 : Classical Encryption Techniques 47

 6. One time pad
 Similar to Vigenere, but use random key as long as plaintext.
 Only known scheme that is unbreakable (unconditional security)
• Ciphertext has no statistical relationship with plaintext.
• Given two potential plaintext messages, attacker cannot
identify the correct message.
 Two practical limitations:
1. Difficult to provide large number of random keys
2. Distributing unique long random keys is difficult

Module 02 : Classical Encryption Techniques 48

 One time pad
 Attacker knows the ciphertext:
 ANKYODKYUREPFJBYOJDSPLREYIUNOFDOIUERFPLUYTS
 Attacker tries all possible keys.
 Two examples:
 key1: pxlmvmsydofuyrvzwctnlebnecvgdupahfzzlmnyih
 Plaintext1: mr mustard with the candlestick in the hall
 key2: mfugpmiydgaxgoufhklllmhsqdqogtewbqfgyovuhwt
 Plaintext2: miss scarlet with the knife in the library
 There are many other legible plaintexts obtained with other keys.
No way for attacker to know the correct plaintext

Module 02 : Classical Encryption Techniques 49

 Transposition Techniques
 A transposition cipher does not substitute one symbol for another,
instead it changes the location of the symbols.
 The simplest such cipher is the rail fence technique, in which the
plaintext is written down as a sequence of diagonals and then
read off as a sequence of rows.
 For example, to send the message “Meet me at the park” to Bob,
Alice writes
M E M A T E A K
E T E T H P R

 She then creates the ciphertext: MEMATEAKETETHPR

Module 02 : Classical Encryption Techniques 51

 Rail Fence Transposition
 Easy to break: letter frequency analysis to determine depth.
 Example:
 Plaintext: internettechnology
 Depth: 3
 Cipher: IRTNGNENTEHOOYTECL

I R T N G
N E N T E H O O Y
T E C L

Module 02 : Classical Encryption Techniques 52

 Rows/Columns Transposition
 Plaintext letters written in rows.
 Ciphertext obtained by reading column-by-column, but re-
arranged.
 Key determines order of columns to read.
Key: 4 3 1 2 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: TTNA APTMTSUO AODW COIX KNLY PETZ

 Easy to break using letter frequency (try different column orders)

Module 02 : Classical Encryption Techniques 53

 Rows/Columns Transposition
 Transposition ciphers can be made stronger by using multiple
stages of transposition
 Plaintext: securityandcryptography
 Key: 315624
 Ciphertext: EYYARDOYSTRRICGCAPPUNTH
 Transpose again using same key:
 Ciphertext: YYCURRAHEOIPDRPYSGNATCT

Module 02 : Classical Encryption Techniques 54

© 2017 Pearson Education, Ltd., All rights reserved.
Steganography

© 2017 Pearson Education, Ltd., All rights reserved.

 • Character marking
• Selected letters of printed or
typewritten text are over-written in
pencil
• The marks are ordinarily not visible
unless the paper is held at an angle
to bright light
Other Steganography
Techniques • Invisible ink
• A number of substances can be used
for writing but leave no visible trace
until heat or some chemical is
applied to the paper
• Pin punctures
• Small pin punctures on selected
letters are ordinarily not visible
unless the paper is held up in front
of a light
• Typewriter correction ribbon
• Used between lines typed with a
black ribbon, the results of typing
with the correction tape are visible
only under a strong light
© 2017 Pearson Education, Ltd., All rights reserved.
 Threat and Attack
 Threat: A potential for violation of security, which exists when
there is a circumstance, capability, action, or event that could
crack security and cause harm. That is, a threat is a possible
danger that might exploit a vulnerability.
 Attack: An violation on system security that derives from an
intelligent threat; that is, an intelligent act that is a calculated
attempt to avoid security services and violate the security policy
of a system.

Module 02 : Classical Encryption Techniques 59

 Cryptanalysis and Brute-Force Attack
 Objective of attacker: recover key (not just message)
 Approaches of attacker:
 Cryptanalysis: This type of attack exploits the characteristics of
the algorithm to attempt to derive a specific plaintext or to derive
the key being used.
 Brute-force attack: The attacker tries every possible key on a piece
of ciphertext until an intelligible translation into plaintext is
obtained.
 On average, half of all possible keys must be tried to achieve
success.

Module 02 : Classical Encryption Techniques 60

 Attacks on Encrypted Messages
Type of Attack Known to cryptanalyst
Ciphertext Only Encryption algorithm, Ciphertext

Module 02 : Classical Encryption Techniques 61

 Attacks on Encrypted Messages
Type of Attack Known to cryptanalyst
Known Plaintext Encryption algorithm, Ciphertext, One or more plaintext-
cipher text pairs formed with the secret key

Module 02 : Classical Encryption Techniques 62

 Attacks on Encrypted Messages
Type of Attack Known to cryptanalyst
Chosen Plaintext Encryption algorithm, Ciphertext, Plaintext message chosen by
cryptanalyst

Module 02 : Classical Encryption Techniques 63

 Attacks on Encrypted Messages
Type of Attack Known to cryptanalyst
Chosen Encryption algorithm, Ciphertext, Ciphertext chosen by
Ciphertext cryptanalyst, with its corresponding decrypted plaintext
generated with the secret key

Module 02 : Classical Encryption Techniques 64

 Attacks on Encrypted Messages
Type of Attack Known to cryptanalyst
Chosen text Encryption algorithm, Ciphertext, Plaintext chosen by
cryptanalyst, with its corresponding ciphertext generated with
the secret key , Ciphertext chosen by cryptanalyst, with its
corresponding decrypted plaintext generated with the secret
key

Module 02 : Classical Encryption Techniques 65

Encryption Scheme Security

 Unconditionally secure
• No matter how much time an opponent has, it is impossible for
him or her to decrypt the ciphertext simply because the
required information is not there
 Computationally secure
• The cost of breaking the cipher exceeds the value of the
encrypted information
• The time required to break the cipher exceeds the useful
lifetime of the information

Module 02 : Classical Encryption Techniques 66

THANK YOU