Computer System SecurityCSE 53397339.ppt

Computer System SecurityCSE 5339/7339 Contents Encryption Substitution and Transposition Ciphers Symmetric and Asymmetric Enciption Merkle-Hellman Knapsacks Murtaza’s Presentation Exercise (Group work) Non-Repeating Series of Numbers One-Time Pads Name ? set of sheets of paper with keys, glued into a pad The sender would tear off enough number of pages The receiver needs a pad identical to the one used by the sender One-Time Pads (cont.) The sender would write the keys one at a time above the letters of the plaintext. K1 k2 k3 k4 ... Kn p1 p2 p3 p4 ... pn The plaintext is enciphered using a pre-arranged chart (Vignere Tableau) – all 26 letters in each column in some scrambled order select the substitution in row pi, column Ki Problems: Unlimited number of keys Absolute synchronization between sender and receiver Vernam Cipher Plaintext V E R N A M C I P H E R 21 4 17 13 0 12 2 8 15 7 4 17 Random numbers 76 48 16 82 44 3 58 11 60 5 48 88 Sum 97 52 33 95 44 15 60 19 75 12 52 105 Sum mod 26 19 0 7 17 18 15 8 19 23 12 0 1 Ciphertext t a h r s p i t x m a b Book Ciphers Both sender and receiver need access to identical objects Example: telephone book – xxx-xxx-xxxx (use xx mod 26 as a key) Problem – High frequency letters A, E, O, T ? 40% of all letters used in Standard English text A, E, O, T, N, I ? 50% of all letters used in Standard English text The probability that the key letter and plain text letter is in these 6 letters is 0.25 Transposition (Diffusion) The letters of the message are rearranged Columnar transposition Example: THIS IS A MESSAGE TO SHOW HOW A COLMUNAR TRANSPOSITION WORKS T H I S I S A M E S S A G E T O S H O W H O W A C O L M U N A R T R A N S P O S I T I O N W O R K S tssoh oaniw haaso lrsto imghw utpir seeoa mrook istwc nasna Stream an