UNIT 2.ppt

UNIT 2.ppt

• 1.
  CSCE 815 NetworkSecurity Lecture 3 Data Encryption Standard (DES)
• 2.
  Outline • Review classicalcryptography – Monoalphabetic Ciphers – cryptanalysis using letter frequencies – Playfair ciphers – polyalphabetic ciphers – transposition ciphers – product ciphers and rotor machines • Background on Block Ciphers • History of DES • DES revisited
• 3.
  Classical Cryptography • SymmetricEncryption – sender and recipient share a common key • Terminology:plaintext, ciphertext, key, cryptanalysis • Requirements – a strong encryption algorithm – a secret key known only to sender / receiver Y = EK(X) X = DK(Y)
• 4.
  Requirements • two requirementsfor secure use of symmetric encryption: – a strong encryption algorithm – a secret key known only to sender / receiver Y = EK(X) X = DK(Y) • assume encryption algorithm is known • implies a secure channel to distribute key
• 5.
  Security Levels • unconditionalsecurity – 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 (eg time needed for calculations is greater than age of universe), the cipher cannot be broken
• 6.
  Classical Substitution Ciphers •earliest known substitution cipher by Julius Caesar • first attested use in military affairs • replaces each letter by 3rd letter on • example: meet me after the toga party PHHW PH DIWHU WKH WRJD SDUWB
• 7.
  Cryptanalysis of RotationCipher • only have 26 possible ciphers – A maps to A,B,..Z • could simply try each in turn • a brute force search • given ciphertext, just try all shifts of letters • do need to recognize when have plaintext • eg. break ciphertext "GCUA VQ DTGCM"
• 8.
  Monoalphabetic Cipher • ratherthan just shifting the alphabet • could shuffle (jumble) the letters arbitrarily • each plaintext letter maps to a different random ciphertext letter • hence key is 26 letters long Plain: abcdefghijklmnopqrstuvwxyz Cipher: DKVQFIBJWPESCXHTMYAUOLRGZN Plaintext: ifwewishtoreplaceletters Ciphertext: WIRFRWAJUHYFTSDVFSFUUFYA
• 9.
  Monoalphabetic 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
• 10.
  Language Redundancy and Cryptanalysis •human languages are redundant • eg "th lrd s m shphrd shll nt wnt" • letters are not equally commonly used • in English e is by far the most common letter • then T,R,N,I,O,A,S • other letters are fairly rare • cf. Z,J,K,Q,X • have tables of single, double & triple letter frequencies
• 11.
  English Letter Frequencies
• 12.
  Use in Cryptanalysis •key concept - monoalphabetic substitution ciphers do not change relative letter frequencies • discovered by Arabian scientists in 9th century • calculate letter frequencies for ciphertext • compare counts/plots against known values • if Caesar cipher look for common peaks/troughs – peaks at: A-E-I triple, NO pair, RST triple – troughs at: JK, X-Z • for monoalphabetic must identify each letter – tables of common double/triple letters help
• 13.
  Example Cryptanalysis • givenciphertext: UZQSOVUOHXMOPVGPOZPEVSGZWSZOPF PESXUDBMETXAIZVUEPHZHMDZSHZOWS FPAPPDTSVPQUZWYMXUZUHSXEPYEPO PDZSZUFPOMBZWPFUPZHMDJUDTMOHM Q • count relative letter frequencies – P 13.33, Z 11.67 – S 8.33, U 8.33, O 7.50 M 6.67 – … – C,K,L,N,R 0.00
• 14.
  Example Cryptanalysis (cont) UZQSOVUOHXMOPVGPOZPEVSGZWS ZOPFPESXUDBMETXAIZVUEPHZHMDZ SHZOWSFPAPPDTSVPQUZWYMXUZU HSXEPYEPOPDZSZUFPOMBZ
• 15.
  Playfair Cipher • noteven the large number of keys in a monoalphabetic cipher provides security • one approach to improving security was to encrypt multiple letters • the Playfair Cipher is an example • invented by Charles Wheatstone in 1854, but named after his friend Baron Playfair
• 16.
  Playfair Key Matrix •a 5X5 matrix of letters based on a keyword • fill in letters of keyword (sans duplicates) • fill rest of matrix with other letters • eg. using the keyword MONARCHY MONAR CHYBD EFGIK LPQST UVWXZ
• 17.
  Encrypting and Decrypting •plaintext encrypted two letters at a time: 1. if a pair is a repeated letter, insert a filler like 'X', eg. "balloon" encrypts as "ba lx lo on" 2. if both letters fall in the same row, replace each with letter to right (wrapping back to start from end), eg. “ar" encrypts as "RM" 3. if both letters fall in the same column, replace each with the letter below it (again wrapping to top from bottom), eg. “mu" encrypts to "CM" 4. otherwise each letter is replaced by the one in its row in the column of the other letter of the pair, eg. “hs" encrypts to "BP", and “ea" to "IM" or "JM" (as desired)
• 18.
  Security of thePlayfair Cipher • security much improved over monoalphabetic • since have 26 x 26 = 676 digrams • would need a 676 entry frequency table to analyse (verses 26 for a monoalphabetic) • and correspondingly more ciphertext • was widely used for many years (eg. US & British military in WW1) • it can be broken, given a few hundred letters • since still has much of plaintext structure
• 19.
  Polyalphabetic Ciphers • anotherapproach 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
• 20.
  Vigenère Cipher • simplestpolyalphabetic substitution cipher is the Vigenère Cipher • effectively multiple 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
• 21.
  Example • write theplaintext 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: deceptivedeceptivedeceptive plaintext: wearediscoveredsaveyourself ciphertext:ZICVTWQNGRZGVTWAVZHCQYGLMGJ
• 22.
  Security of VigenèreCiphers • have multiple ciphertext letters for each plaintext letter • hence letter frequencies are obscured • but not totally lost • start with letter frequencies – see if look monoalphabetic or not • if not, then need to determine number of alphabets, since then can attack each
• 23.
  Kasiski Attack • methoddeveloped by Babbage / Kasiski • repetitions in ciphertext give clues to period • so find same plaintext an exact period apart • which results in the same ciphertext • of course, could also be random fluke • eg repeated “VTW” in previous example • suggests size of 3 or 9 • then attack each monoalphabetic cipher individually using same techniques as before
• 24.
  Vernam Cipher (1918) •Key as long as and indepdent of the plaintext • Works on binary data as opposed to letters • Ci = Pi (xor) Ki • Where – Pi – ith binary digit of plaintext – Ki – ith digit of key – Ci – ith digit of ciphertext • Key needs to be long and random
• 25.
  One-Time Pad • ifa 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
• 26.
  Transposition Ciphers • nowconsider 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
• 27.
  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: 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
• 28.
  Product Ciphers • ciphersusing 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
• 29.
  Rotor Machines • beforemodern ciphers, rotor machines were most common product cipher • were widely used in WW2 – German Enigma, Allied Hagelin, Japanese Purple • implemented a very complex, varying substitution cipher • used a series of cylinders, each giving one substitution, which rotated and changed after each letter was encrypted • with 3 cylinders have 263=17576 alphabets
• 30.
  Classical Cryptography 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
• 31.
  Block vs StreamCiphers • block ciphers process messages in into blocks, each of which is then en/decrypted • like a substitution on very big characters – 64-bits or more • stream ciphers process messages a bit or byte at a time when en/decrypting • many current ciphers are block ciphers • hence are focus of course
• 32.
  Block Cipher Principles •most symmetric block ciphers are based on a Feistel Cipher Structure • needed since must be able to decrypt ciphertext to recover messages efficiently • block ciphers look like an extremely large substitution • would need table of 264 entries for a 64-bit block • instead create from smaller building blocks • using idea of a product cipher
• 33.
  Claude Shannon andSubstitution- Permutation Ciphers • in 1949 Claude Shannon introduced idea of substitution-permutation (S-P) networks – modern substitution-transposition product cipher • these form the basis of modern block ciphers • S-P networks are based on the two primitive cryptographic operations we have seen before: – substitution (S-box) – permutation (P-box) • provide confusion and diffusion of message
• 34.
  Confusion and Diffusion •cipher needs to completely obscure statistical properties of original message • a one-time pad does this • more practically Shannon suggested combining elements to obtain: • diffusion – dissipates statistical structure of plaintext over bulk of ciphertext • confusion – makes relationship between ciphertext and key as complex as possible
• 35.
  Feistel Cipher Structure •Horst Feistel devised the feistel cipher – based on concept of invertible product cipher • partitions input block into two halves – process through multiple rounds which – perform a substitution on left data half – based on round function of right half & subkey – then have permutation swapping halves • implements Shannon’s substitution- permutation network concept
• 36.
  Feistel Cipher Structure
• 37.
  Feistel Cipher DesignPrinciples • block size – increasing size improves security, but slows cipher • key size – increasing size improves security, makes exhaustive key searching harder, but may slow cipher • number of rounds – increasing number improves security, but slows cipher • subkey generation – greater complexity can make analysis harder, but slows cipher • round function – greater complexity can make analysis harder, but slows cipher • fast software en/decryption & ease of analysis – are more recent concerns for practical use and testing
• 38.
  Feistel Cipher Decryption
• 39.
  Data Encryption Standard(DES) • most widely used block cipher in world • adopted in 1977 by NBS (now NIST) – as FIPS PUB 46 • encrypts 64-bit data using 56-bit key • has widespread use • has been considerable controversy over its security
• 40.
  DES History • IBMdeveloped Lucifer cipher – by team led by Feistel – used 64-bit data blocks with 128-bit key • then redeveloped as a commercial cipher with input from NSA and others • in 1973 NBS issued request for proposals for a national cipher standard • IBM submitted their revised Lucifer which was eventually accepted as the DES
• 41.
  DES Design Controversy •although DES standard is public • was considerable controversy over design – in choice of 56-bit key (vs Lucifer 128-bit) – and because design criteria were classified • subsequent events and public analysis show in fact design was appropriate • DES has become widely used, esp in financial applications
• 42.
  DES Encryption
• 43.
  Initial Permutation IP •first step of the data computation • IP reorders the input data bits • even bits to LH half, odd bits to RH half • quite regular in structure (easy in h/w) • see text Table 3.2 • example: IP(675a6967 5e5a6b5a) = (ffb2194d 004df6fb)
• 44.
  DES Round Structure •uses two 32-bit L & R halves • as for any Feistel cipher can describe as: Li = Ri–1 Ri = Li–1 xor F(Ri–1, Ki) • takes 32-bit R half and 48-bit subkey and: – expands R to 48-bits using perm E – adds to subkey – passes through 8 S-boxes to get 32-bit result – finally permutes this using 32-bit perm P
• 45.
  DES Round Structure
• 46.
  Substitution Boxes S •have eight S-boxes which map 6 to 4 bits • each S-box is actually 4 little 4 bit boxes – outer bits 1 & 6 (row bits) select one rows – inner bits 2-5 (col bits) are substituted – result is 8 lots of 4 bits, or 32 bits • row selection depends on both data & key – feature known as autoclaving (autokeying) • example: S(18 09 12 3d 11 17 38 39) = 5fd25e03
• 47.
  DES Key Schedule •forms subkeys used in each round • consists of: – initial permutation of the key (PC1) which selects 56-bits in two 28-bit halves – 16 stages consisting of: • selecting 24-bits from each half • permuting them by PC2 for use in function f, • rotating each half separately either 1 or 2 places depending on the key rotation schedule K
• 48.
  DES Decryption • decryptmust unwind steps of data computation • with Feistel design, do encryption steps again • using subkeys in reverse order (SK16 … SK1) • note that IP undoes final FP step of encryption • 1st round with SK16 undoes 16th encrypt round • …. • 16th round with SK1 undoes 1st encrypt round • then final FP undoes initial encryption IP • thus recovering original data value
• 49.
  Avalanche Effect • keydesirable property of encryption alg • where a change of one input or key bit results in changing approx half output bits • making attempts to “home-in” by guessing keys impossible • DES exhibits strong avalanche
• 50.
  Strength of DES– Key Size • 56-bit keys have 256 = 7.2 x 1016 values • brute force search looks hard • recent advances have shown is possible – in 1997 on Internet in a few months – in 1998 on dedicated h/w (EFF) in a few days – in 1999 above combined in 22hrs! • still must be able to recognize plaintext • now considering alternatives to DES
• 51.
  Strength of DES– Timing Attacks • attacks actual implementation of cipher • use knowledge of consequences of implementation to derive knowledge of some/all subkey bits • specifically use fact that calculations can take varying times depending on the value of the inputs to it • particularly problematic on smartcards
• 52.
  Strength of DES– Analytic Attacks • now have several analytic attacks on DES • these utilise some deep structure of the cipher – by gathering information about encryptions – can eventually recover some/all of the sub-key bits – if necessary then exhaustively search for the rest • generally these are statistical attacks • include – differential cryptanalysis – linear cryptanalysis – related key attacks
• 53.
  Differential Cryptanalysis • oneof the most significant recent (public) advances in cryptanalysis • known by NSA in 70's cf DES design • Murphy, Biham & Shamir published 1990 • powerful method to analyse block ciphers • used to analyse most current block ciphers with varying degrees of success • DES reasonably resistant to it, cf Lucifer
• 54.
  Differential Cryptanalysis • astatistical attack against Feistel ciphers • uses cipher structure not previously used • design of S-P networks has output of function f influenced by both input & key • hence cannot trace values back through cipher without knowing values of the key • Differential Cryptanalysis compares two related pairs of encryptions
• 55.
  Differential Cryptanalysis Compares Pairsof Encryptions • with a known difference in the input • searching for a known difference in output • when same subkeys are used
• 56.
  Differential Cryptanalysis • havesome input difference giving some output difference with probability p • if find instances of some higher probability input / output difference pairs occurring • can infer subkey that was used in round • then must iterate process over many rounds (with decreasing probabilities)
• 57.
  Differential Cryptanalysis
• 58.
  Differential Cryptanalysis • performattack by repeatedly encrypting plaintext pairs with known input XOR until obtain desired output XOR • when found – if intermediate rounds match required XOR have a right pair – if not then have a wrong pair, relative ratio is S/N for attack • can then deduce keys values for the rounds – right pairs suggest same key bits – wrong pairs give random values • for large numbers of rounds, probability is so low that more pairs are required than exist with 64-bit inputs • Biham and Shamir have shown how a 13-round iterated characteristic can break the full 16-round DES
• 59.
  Linear Cryptanalysis • anotherrecent development • also a statistical method • must be iterated over rounds, with decreasing probabilities • developed by Matsui et al in early 90's • based on finding linear approximations • can attack DES with 247 known plaintexts, still in practise infeasible
• 60.
  Linear Cryptanalysis • findlinear approximations with prob p != ½ P[i1,i2,...,ia](+)C[j1,j2,...,jb] = K[k1,k2,...,kc] where ia,jb,kc are bit locations in P,C,K • gives linear equation for key bits • get one key bit using max likelihood alg • using a large number of trial encryptions • effectiveness given by: |p–½|
• 61.
  Block Cipher DesignPrinciples • basic principles still like Feistel in 1970’s • number of rounds – more is better, exhaustive search best attack • function f: – provides “confusion”, is nonlinear, avalanche • key schedule – complex subkey creation, key avalanche
• 62.
  Modes of Operation •block ciphers encrypt fixed size blocks • eg. DES encrypts 64-bit blocks, with 56-bit key • need way to use in practise, given usually have arbitrary amount of information to encrypt • four were defined for DES in ANSI standard ANSI X3.106-1983 Modes of Use • subsequently now have 5 for DES and AES • have block and stream modes
• 63.
  Electronic Codebook Book(ECB) • message is broken into independent blocks which are encrypted • each block is a value which is substituted, like a codebook, hence name • each block is encoded independently of the other blocks Ci = DESK1 (Pi) • uses: secure transmission of single values
• 64.
  Electronic Codebook Book(ECB)
• 65.
  Advantages and Limitationsof ECB • repetitions in message may show in ciphertext – if aligned with message block – particularly with data such graphics – or with messages that change very little, which become a code-book analysis problem • weakness due to encrypted message blocks being independent • main use is sending a few blocks of data
• 66.
  Cipher Block Chaining(CBC) • message is broken into blocks • but these are linked together in the encryption operation • each previous cipher blocks is chained with current plaintext block, hence name • use Initial Vector (IV) to start process Ci = DESK1(Pi XOR Ci-1) C-1 = IV • uses: bulk data encryption, authentication
• 67.
  Cipher Block Chaining(CBC)
• 68.
  Advantages and Limitationsof CBC • each ciphertext block depends on all message blocks • thus a change in the message affects all ciphertext blocks after the change as well as the original block • need Initial Value (IV) known to sender & receiver – however if IV is sent in the clear, an attacker can change bits of the first block, and change IV to compensate – hence either IV must be a fixed value (as in EFTPOS) or it must be sent encrypted in ECB mode before rest of message • at end of message, handle possible last short block – by padding either with known non-data value (eg nulls) – or pad last block with count of pad size • eg. [ b1 b2 b3 0 0 0 0 5] <- 3 data bytes, then 5 bytes pad+count
• 69.
  Cipher FeedBack (CFB) •message is treated as a stream of bits • added to the output of the block cipher • result is feed back for next stage (hence name) • standard allows any number of bit (1,8 or 64 or whatever) to be feed back – denoted CFB-1, CFB-8, CFB-64 etc • is most efficient to use all 64 bits (CFB-64) Ci = Pi XOR DESK1(Ci-1) C-1 = IV • uses: stream data encryption, authentication
• 70.
  Cipher FeedBack (CFB)
• 71.
  Advantages and Limitationsof CFB • appropriate when data arrives in bits/bytes • most common stream mode • limitation is need to stall while do block encryption after every n-bits • note that the block cipher is used in encryption mode at both ends • errors propogate for several blocks after the error
• 72.
  Output FeedBack (OFB) •message is treated as a stream of bits • output of cipher is added to message • output is then feed back (hence name) • feedback is independent of message • can be computed in advance Ci = Pi XOR Oi Oi = DESK1(Oi-1) O-1 = IV • uses: stream encryption over noisy channels
• 73.
  Output FeedBack (OFB)
• 74.
  Advantages and Limitationsof OFB • used when error feedback a problem or where need to encryptions before message is available • superficially similar to CFB • but feedback is from the output of cipher and is independent of message • a variation of a Vernam cipher – hence must never reuse the same sequence (key+IV) • sender and receiver must remain in sync, and some recovery method is needed to ensure this occurs • originally specified with m-bit feedback in the standards • subsequent research has shown that only OFB-64 should ever be used
• 75.
  Counter (CTR) • a“new” mode, though proposed early on • similar to OFB but encrypts counter value rather than any feedback value • must have a different key & counter value for every plaintext block (never reused) Ci = Pi XOR Oi Oi = DESK1(i) • uses: high-speed network encryptions
• 76.
  Counter (CTR)
• 77.
  Advantages and Limitationsof CTR • efficiency – can do parallel encryptions – in advance of need – good for bursty high speed links • random access to encrypted data blocks • provable security (good as other modes) • but must ensure never reuse key/counter values, otherwise could break (cf OFB)
• 78.
  Summary • have considered: •block cipher design principles • DES – details – strength • Differential & Linear Cryptanalysis • Modes of Operation – ECB, CBC, CFB, OFB, CTR