Professional Documents
Culture Documents
CH 02
CH 02
Introduction
Basic Terminology
1
Cryptographic Systems
Cryptographic Systems
Symmetric Encryption Model
2
Cryptographic Systems
Requirements
• two requirements for secure use of symmetric
encryption:
•X = Dk(Y)
Cryptographic Systems
Attacks:
1. Cryptanalytic Attacks: depends on the nature of the
encryption algorithm used.
• Uses information such as plaintext/ciphertext pairs to deduce
the key
3
Cryptographic Systems
Security Definitions
• unconditional security
• no matter how much computer power 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 (e.g., time needed for
calculations is greater than age of universe), the cipher cannot
be broken
Shift Cipher:
Letters of the alphabet are assigned a number as below
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
Algorithm:
Let P = C = K= Ζ26 and x ∈ P, y ∈ C, k ∈ K
4
Shift Ciphers- cont.
Remark: When k = 3 the shift cipher is given a special name -
Caesar Cipher.
Substitution Ciphers
Monoalphabetic Cipher
• Jumble the letters arbitrarily
•Plaintext: ifwewishtoreplaceletters
•Ciphertext: WIRFRWAJUHYFTSDVFSFUUFYA
Dr. Lo’ai Tawalbeh Fall 2005
5
Substitution Ciphers
Attacks: Frequency Analysis
• Letter frequency analysis (Same plaintext maps to same
ciphertext): language redundancy :
6
Use in Cryptanalysis
Example Cryptanalysis
• given ciphertext:
UZQSOVUOHXMOPVGPOZPEVSGZWSZOPFPESXUDBMETSXAIZ
VUEPHZHMDZSHZOWSFPAPPDTSVPQUZWYMXUZUHSX
EPYEPOPDZSZUFPOMBZWPFUPZHMDJUDTMOHMQ
7
Playfair Key
8
Security of the Playfair Cipher
Hill Cipher
Example: Let n=3 and the key matrix be M, C=PM
The key is an n × n matrix whose entries are integers in Ζ26.
⎛ 1 2 3⎞
⎜ ⎟
M = ⎜ 4 5 6⎟
⎜11 9 8 ⎟
⎝ ⎠
and the plaintext be ABC = (0, 1, 2) then the encryption
operation is a vector-matrix multiplication
⎛ 1 2 3⎞
⎜ ⎟
(0,1,2) × ⎜ 4 5 6 ⎟ ≡ (0,23,22) mod 26 ⇒ AXW (ciphertext)
⎜11 9 8 ⎟
⎝ ⎠
In order to decrypt we need the inverse of key matrix
M, which is ⎛ 22 5 1 ⎞
⎜ ⎟
N = ⎜ 6 17 24 ⎟
⎜ 15 13 1 ⎟
⎝ ⎠
Dr. Lo’ai Tawalbeh Fall 2005
9
Polyalphabetic Ciphers
Vigenère Cipher
10
Example
11
Kasiski Method
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
12
One-Time Pad
Transposition Ciphers
13
Rail Fence cipher
• giving ciphertext
MEMATRHTGPRYETEFETEOAAT
14
Product Ciphers
Rotor Machines
15
Steganography
• an alternative to encryption
• hides existence of message
• using only a subset of letters/words in a longer message
marked in some way
• using invisible ink
• hiding in LSB in graphic image or sound file
• has drawbacks
• high overhead to hide relatively few info bits
Summary
• have considered:
• classical cipher techniques and terminology
• monoalphabetic substitution ciphers
• cryptanalysis using letter frequencies
• Playfair ciphers
• polyalphabetic ciphers
• transposition ciphers
• product ciphers and rotor machines
• stenography
16