chapter 2 classical encryption techniques

39
Chapter 2 Chapter 2 Classical Encryption Classical Encryption Techniques Techniques

Upload: hao

Post on 18-Mar-2016

107 views

Category:

Documents


6 download

DESCRIPTION

Chapter 2 Classical Encryption Techniques. Symmetric Encryption. conventional / private-key / single-key sender and recipient share a common key all classical encryption algorithms are private-key. Basic Terminology. plaintext - the original message ciphertext - the coded message - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: Chapter 2 Classical Encryption Techniques

Chapter 2Chapter 2Classical Encryption TechniquesClassical Encryption Techniques

Page 2: Chapter 2 Classical Encryption Techniques

Symmetric EncryptionSymmetric Encryption

conventional / conventional / private-keyprivate-key / single-key / single-key sender and recipient share a common sender and recipient share a common

keykey all classical encryption algorithms are all classical encryption algorithms are

private-keyprivate-key

Page 3: Chapter 2 Classical Encryption Techniques

Basic TerminologyBasic Terminology plaintext - the original message ciphertext - the 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) - the study of principles/

methods of deciphering ciphertext without knowing key cryptology - the field of both cryptography and

cryptanalysis

Page 4: Chapter 2 Classical Encryption Techniques

Symmetric Cipher ModelSymmetric Cipher Model

Page 5: Chapter 2 Classical Encryption Techniques

RequirementsRequirements

two requirements for secure use of two requirements for secure use of symmetric encryption:symmetric encryption:• a strong encryption algorithma strong encryption algorithm• a secret key known only to sender / receivera secret key known only to sender / receiver

Y Y = E= EKK((XX))

X X = D= DKK((YY)) assume encryption algorithm is knownassume encryption algorithm is known implies a secure channel to distribute keyimplies a secure channel to distribute key

Page 6: Chapter 2 Classical Encryption Techniques

Symmetric Cipher ModelSymmetric Cipher Model

Page 7: Chapter 2 Classical Encryption Techniques

CryptographyCryptography

can characterize by:can characterize by:• type of encryption operations usedtype of encryption operations used

– substitution / transposition / productsubstitution / transposition / product• number of keys usednumber of keys used

– single-key or private / two-key or publicsingle-key or private / two-key or public• way in which plaintext is processedway in which plaintext is processed

– block / streamblock / stream

Page 8: Chapter 2 Classical Encryption Techniques

Approaches to attack encryption scheme:Approaches to attack encryption scheme:

CryptanalysisCryptanalysis Brute-force attack Brute-force attack

Page 9: Chapter 2 Classical Encryption Techniques

Types of Cryptanalytic AttacksTypes of Cryptanalytic Attacks ciphertext onlyciphertext only

• only know algorithm / ciphertext, statistical, can identify only know algorithm / ciphertext, statistical, can identify plaintext plaintext

known plaintextknown plaintext • know/suspect plaintext & ciphertext to attack cipher know/suspect plaintext & ciphertext to attack cipher

chosen plaintextchosen plaintext • select plaintext and obtain ciphertext to attack cipherselect plaintext and obtain ciphertext to attack cipher

chosen ciphertextchosen ciphertext • select ciphertext and obtain plaintext to attack cipherselect ciphertext and obtain plaintext to attack cipher

chosen textchosen text • select either plaintext or ciphertext to en/decrypt to select either plaintext or ciphertext to en/decrypt to

attack cipherattack cipher

Page 10: Chapter 2 Classical Encryption Techniques

Brute Force SearchBrute Force Search

always possible to simply try every key always possible to simply try every key most basic attack, proportional to key size most basic attack, proportional to key size assume either know / recognise plaintextassume either know / recognise plaintext

Page 11: Chapter 2 Classical Encryption Techniques

More DefinitionsMore 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

• there is no encryption algorithm that is unconditionally secure

computational security • 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.

Page 12: Chapter 2 Classical Encryption Techniques

Classical Substitution CiphersClassical Substitution Ciphers

where where letters of plaintext are replaced letters of plaintext are replaced by other letters or by numbers or by other letters or by numbers or symbolssymbols

Page 13: Chapter 2 Classical Encryption Techniques

Caesar CipherCaesar Cipher

earliest known substitution cipherearliest known substitution cipher by Julius Caesar by Julius Caesar first attested use in military affairsfirst attested use in military affairs replaces each letter by 3rd letter onreplaces each letter by 3rd letter on example:example:

meet me after the toga partymeet me after the toga partyPHHW PH DIWHU WKH WRJD SDUWBPHHW PH DIWHU WKH WRJD SDUWB

Page 14: Chapter 2 Classical Encryption Techniques

Caesar CipherCaesar Cipher

can define transformation as:can define transformation as: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 za b c d e f g h i j k l m n o p q r s t u v w x y zD E F G H I J K L M N O P Q R S T U V W X Y Z A B CD 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

mathematically give each letter a numbermathematically give each letter a numbera b c d e f g h i j k l ma b c d e f g h i j k l m0 1 2 3 4 5 6 7 8 9 10 11 120 1 2 3 4 5 6 7 8 9 10 11 12n o p q r s t u v w x y Zn o p q r s t u v w x y Z13 14 15 16 17 18 19 20 21 22 23 24 2513 14 15 16 17 18 19 20 21 22 23 24 25

then have Caesar cipher as:then have Caesar cipher as:C C = E(= E(pp) = () = (p p + + kk) mod (26)) mod (26)p p = D(C) = (C – = D(C) = (C – kk) mod (26)) mod (26)

Page 15: Chapter 2 Classical Encryption Techniques

Cryptanalysis of Caesar CipherCryptanalysis of Caesar Cipher

only have 25 possible ciphers only have 25 possible ciphers • A maps to B,..Z A maps to B,..Z

could simply try each in turn could simply try each in turn a a brute force searchbrute force search given ciphertext, just try all shifts of lettersgiven ciphertext, just try all shifts of letters do need to recognize when have plaintextdo need to recognize when have plaintext eg. break ciphertext "GCUA VQ DTGCM"eg. break ciphertext "GCUA VQ DTGCM"

Page 16: Chapter 2 Classical Encryption Techniques

Cryptanalysis of Caesar CipherCryptanalysis of Caesar Cipher

Page 17: Chapter 2 Classical Encryption Techniques

Monoalphabetic CipherMonoalphabetic Cipher rather than just shifting the alphabet each plaintext letter maps to a different random

ciphertext letter any permutation of the 26 characters hence key is 26 letters long

Plain: abcdefghijklmnopqrstuvwxyz Cipher: DKVQFIBJWPESCXHTMYAUOLRGZNPlaintext: ifwewishtoreplacelettersCiphertext: WIRFRWAJUHYFTSDVFSFUUFYA

Page 18: Chapter 2 Classical Encryption Techniques

Monoalphabetic Cipher SecurityMonoalphabetic Cipher Security now have a total of 26! > 4 x 1026 keys with so many keys, might think is secure, but

would be !!!WRONG!!! problem is language characteristics attack: exploit the regularities of the language letters are not equally commonly used in English e is by far the most common letter, then

T,R,N,I,O,A,S have tables of single, double & triple letter double & triple letter

frequencies frequencies

Page 19: Chapter 2 Classical Encryption Techniques

English Letter FrequenciesEnglish Letter Frequencies

Page 20: Chapter 2 Classical Encryption Techniques

Example CryptanalysisExample Cryptanalysis given ciphertext:

UZQSOVUOHXMOPVGPOZPEVSGZWSZOPFPESXUDBMETSXAIZVUEPHZHMDZSHZOWSFPAPPDTSVPQUZWYMXUZUHSXEPYEPOPDZSZUFPOMBZWPFUPZHMDJUDTMOHMQ

count relative letter frequencies (see text) guess P & Z are e and t guess ZW is th and hence ZWP is the proceeding with trial and error finally get:

it was disclosed yesterday that several informal butdirect contacts have been made with politicalrepresentatives of the vietcong in moscow

Page 21: Chapter 2 Classical Encryption Techniques

Playfair CipherPlayfair Cipher

not even the large number of keys in a not even the large number of keys in a monoalphabetic cipher provides security monoalphabetic cipher provides security

one approach to improving security was to one approach to improving security was to encrypt multiple letters encrypt multiple letters

thethe Playfair Cipher Playfair Cipher is an example is an example invented by Charles Wheatstone in 1854, invented by Charles Wheatstone in 1854,

but named after his friend Baron Playfair but named after his friend Baron Playfair

Page 22: Chapter 2 Classical Encryption Techniques

Playfair Key MatrixPlayfair Key Matrix a 5x5 matrix of letters based on a keyword fill in letters of keyword (without duplicates) fill rest of matrix with other letters eg. using the keyword MONARCHY

MONARCHYBDEFGI/JKLPQSTUVWXZ

Page 23: Chapter 2 Classical Encryption Techniques

Encrypting and DecryptingEncrypting and Decrypting plaintext encrypted two letters at a time: plaintext encrypted two letters at a time:

1.1. if a pair is a repeated letter, insert a filler like 'X', if a pair is a repeated letter, insert a filler like 'X', eg. "balloon" encrypts as "ba lx lo on" eg. "balloon" encrypts as "ba lx lo on"

2.2. if both letters fall in the same row, replace each with if both letters fall in the same row, replace each with letter to right (wrapping back to start from end), letter to right (wrapping back to start from end), eg. “ar" encrypts as "RM" eg. “ar" encrypts as "RM"

3.3. if both letters fall in the same column, replace each if both letters fall in the same column, replace each with the letter below it (again wrapping to top from with the letter below it (again wrapping to top from bottom), eg. “mu" encrypts to "CM" bottom), eg. “mu" encrypts to "CM"

4.4. otherwise each letter is replaced by the one in its row otherwise each letter is replaced by the one in its row in the column of the other letter of the pair, eg. “hs" in the column of the other letter of the pair, eg. “hs" encrypts to "BP", and “ea" to "IM" or "JM" (as encrypts to "BP", and “ea" to "IM" or "JM" (as desired) desired)

Page 24: Chapter 2 Classical Encryption Techniques

Security of the Playfair CipherSecurity of the Playfair Cipher security much improved over monoalphabeticsecurity much improved over monoalphabetic since have 26 x 26 = 676 digrams since have 26 x 26 = 676 digrams would need a 676 entry frequency table to analyse would need a 676 entry frequency table to analyse

(verses 26 for a monoalphabetic) (verses 26 for a monoalphabetic) and correspondingly more ciphertext and correspondingly more ciphertext was widely used for many years (eg. US & British was widely used for many years (eg. US & British

military in WW1) military in WW1) it it cancan be broken, given a few hundred letters be broken, given a few hundred letters since still has much of plaintext structure since still has much of plaintext structure

Page 25: Chapter 2 Classical Encryption Techniques

Hill CipherHill Cipher M linear equations encry m letters at a time Completely hide single-letter frequencies It is easily broken with a known plaintext attack C=Ek(P)=KP mod 26 K is a m*m matrix; KK-1=K-1K=I P=Dk(C)=K –1C mod 26 m=3 26mod

3

2

1

333231

232221

131211

3

2

1

ppp

kkkkkkkkk

ccc

Page 26: Chapter 2 Classical Encryption Techniques

Polyalphabetic CiphersPolyalphabetic Ciphers another approach to improving security is to use

multiple cipher alphabets called polyalphabetic substitution ciphers makes cryptanalysis harder with more alphabets

to guess and flatter frequency distribution use a key to select which alphabet is used for each

letter of the message use each alphabet in turn repeat from start after end of key is reached

Page 27: Chapter 2 Classical Encryption Techniques

Vigenère CipherVigenère Cipher simplest polyalphabetic substitution cipher is

the Vigenère Cipher 26 caesar ciphers key is multiple letters long K = k1 k2 ... kd ith letter specifies ith alphabet to use use each alphabet in turn repeat from start after d letters in message decryption simply works in reverse

Page 28: Chapter 2 Classical Encryption Techniques
Page 29: Chapter 2 Classical Encryption Techniques

Vigenère Cipher Example write the plaintext out write the keyword repeated above it use each key letter as a caesar cipher key encrypt the corresponding plaintext letter eg using keyword deceptive

key: deceptivedeceptivedeceptiveplaintext: wearediscoveredsaveyourselfciphertext:ZICVTWQNGRZGVTWAVZHCQYGLMGJ

Page 30: Chapter 2 Classical Encryption Techniques

Security of Security of Vigenère CiphersVigenère Ciphers

have multiple ciphertext letters for each plaintext letter

hence letter frequencies are obscured but not totally lost If two identical sequences of plaintext letters occu

r at a distance that is an integer multiple of the keyword length, they will generate identical ciphertext sequences.

Page 31: Chapter 2 Classical Encryption Techniques

Vernam Vernam CipherCipher

A keyword is as long as the plaintext and has no statistical relationship to it

Encrypt binary data rather than letters Exclusive-or(XOR) operation ci=pi ki; pi=ci ki

Page 32: Chapter 2 Classical Encryption Techniques

One-Time PadOne-Time Pad

if a truly random key as long as the message is used, if a truly random key as long as the message is used, the cipher will be secure the cipher will be secure

called a One-Time padcalled a One-Time pad is unbreakable since ciphertext bears no statistical is unbreakable since ciphertext bears no statistical

relationship to the plaintextrelationship to the plaintext since for since for any plaintextany plaintext & & any ciphertextany ciphertext there exists a there exists a

key mapping one to otherkey mapping one to other can only use the key can only use the key onceonce though though the same plaintexts may produce different ciphertextsthe same plaintexts may produce different ciphertexts have problem of safe distribution of keyhave problem of safe distribution of key

Page 33: Chapter 2 Classical Encryption Techniques

Transposition CiphersTransposition Ciphers

now consider classical now consider classical transpositiontransposition or or permutationpermutation ciphers ciphers

these hide the message by rearranging the these hide the message by rearranging the letter order letter order

without altering the actual letters usedwithout altering the actual letters used can recognise these since have the same can recognise these since have the same

frequency distribution as the original text frequency distribution as the original text

Page 34: Chapter 2 Classical Encryption Techniques

Rail Fence cipherRail Fence cipher

write message letters out diagonally over a write message letters out diagonally over a number of rows number of rows

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

m e m a t r h t g p r ym e m a t r h t g p r y e t e f e t e o a a te t e f e t e o a a t

giving ciphertextgiving ciphertextMEMATRHTGPRYETEFETEOAATMEMATRHTGPRYETEFETEOAAT

Page 35: Chapter 2 Classical Encryption Techniques

Row Transposition CiphersRow Transposition Ciphers a more complex schemea more complex scheme write letters of message out in rows over a write letters of message out in rows over a

specified number of columnsspecified number of columns then reorder the columns according to some then reorder the columns according to some

key before reading off the rowskey before reading off the rowsKey: 4 3 1 2 5 6 7Key: 4 3 1 2 5 6 7Plaintext: a t t a c k pPlaintext: a t t a c k p o s t p o n eo s t p o n e d u n t i l td u n t i l t w o a m x y zw o a m x y zCiphertext: TTNAAPTMTSUOAODWCOIXKNLYPETZCiphertext: TTNAAPTMTSUOAODWCOIXKNLYPETZ

Page 36: Chapter 2 Classical Encryption Techniques

Product CiphersProduct Ciphers ciphers using substitutions or transpositions are ciphers using substitutions or transpositions are

not secure because of language characteristicsnot secure because of language characteristics hence consider using several ciphers in succession hence consider using several ciphers in succession

to make harder, but: to make harder, but: • two substitutions make a more complex substitution two substitutions make a more complex substitution • two transpositions make more complex transposition two transpositions make more complex transposition • but a substitution followed by a transposition makes a but a substitution followed by a transposition makes a

new much harder cipher new much harder cipher this is bridge from classical to modern ciphersthis is bridge from classical to modern ciphers

Page 37: Chapter 2 Classical Encryption Techniques

Rotor MachinesRotor Machines before modern ciphers, rotor machines before modern ciphers, rotor machines

were most common product cipherwere most common product cipher implemented a very complex, varying implemented a very complex, varying

substitution ciphersubstitution cipher used a series of cylinders, each giving one used a series of cylinders, each giving one

substitution, which rotated and changed substitution, which rotated and changed after each letter was encryptedafter each letter was encrypted

with 3 cylinders have 26with 3 cylinders have 2633=17576 alphabets=17576 alphabets

Page 38: Chapter 2 Classical Encryption Techniques
Page 39: Chapter 2 Classical Encryption Techniques

SteganographySteganography an alternative to encryptionan alternative to encryption hides existence of messagehides existence of message

• using only a subset of letters/words in a longer using only a subset of letters/words in a longer message marked in some waymessage marked in some way

• using invisible inkusing invisible ink• hiding a message by using LSB in graphic hiding a message by using LSB in graphic

image or sound fileimage or sound file has drawbackshas drawbacks

• high overhead to hide relatively few info bitshigh overhead to hide relatively few info bits