CSCE 790G: Computer Network Security

Slides:



Advertisements
Similar presentations
CLASSICAL ENCRYPTION TECHNIQUES
Advertisements

Classical Encryption Techniques Week 6-wend. One-Time Pad if a truly random key as long as the message is used, the cipher will be secure called a One-Time.
Cryptography and Network Security Chapter 2
Cryptography and Network Security Chapter 2. Chapter 2 – Classical Encryption Techniques Many savages at the present day regard their names as vital parts.
Announcement Grading adjusted –10% participation and two exams 20% each Newsgroup up Assignment upload webpage up Homework 1 will be released over the.
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.
Chapter 2 – Classical Encryption Techniques. Classical Encryption Techniques Symmetric Encryption Or conventional / private-key / single-key sender and.
Classical Encryption Techniques
Review What is security: history and definition Security policy, mechanisms and services Security models.
Classical Encryption Techniques
Overview of Cryptographic Techniques Hector M Lugo-Cordero CIS 4361 Secure Operating System Administration 1.
Chapter 2 – Classical Encryption Techniques
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.
Classical Encryption Techniques
Cryptography. Secret (crypto) Writing (graphy) –[Greek word] Practice and study of hiding information Concerned with developing algorithms for: –Conceal.
Cryptography and Network Security Chapter 2. Chapter 2 – Classical Encryption Techniques Many savages at the present day regard their names as vital parts.
Cryptography Cryptography is the technique of secret writing.
Dr. Lo’ai Tawalbeh 2007 Chapter 2: Classical Encryption Techniques Dr. Lo’ai Tawalbeh New York Institute of Technology (NYIT) Jordan’s Campus INCS.
1 University of Palestine Information Security Principles ITGD 2202 Ms. Eman Alajrami 2 nd Semester
Chapter 2 Classical Encryption Techniques. Symmetric Encryption n conventional / private-key / single-key n sender and recipient share a common key n.
Hill Cipher Developed by the mathematician Lester Hill in The encryption algorithm takes m successive plain text and substitute for them m cipher.
Network Security (Course Details) By ASIM SHAHZAD Assistant Professor University Of Engineering And Technology Taxila.
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.
Computer Science&Technology School of Shandong University Instructor: Hou Mengbo houmb AT sdu.edu.cn Office: Information Security Research Group.
Cryptography and Network Security Chapter 2. Symmetric Encryption  or conventional / private-key / single-key  sender and recipient share a common key.
Cryptography and Network Security (CS435) Part Two (Classic Encryption Techniques)
Cryptography and Network Security Chapter 2 Fourth Edition by William Stallings Lecture slides by Lawrie Brown.
Symmetric Encryption or conventional / private-key / single-key sender and recipient share a common key all classical encryption algorithms are private-key.
Network Security Lecture 12 Presented by: Dr. Munam Ali Shah.
Classical Encryption Techniques CSE 651: Introduction to Network Security.
 Classic Crypto  Slides based on those developed by Dr. Lawrie Brown at the Australian Defence Force Academy, University College, UNSW  See
1 Chapter 2-1 Conventional Encryption Message Confidentiality.
Network Security Lecture 11 Presented by: Dr. Munam Ali Shah.
Rather than just shifting the alphabet Could shuffle (jumble) the letters arbitrarily Each plaintext letter maps to a different random cipher text letter.
Module :MA3036NI Cryptography and Number Theory Lecture Week 3 Symmetric Encryption-2.
1 University of Palestine Information Security Principles ITGD 2202 Ms. Eman Alajrami.
Computer and Network Security Rabie A. Ramadan Lecture 2.
Data Security and Encryption (CSE348) 1. Lecture # 4 2.
Data Security and Encryption (CSE348) 1. Lecture # 3 2.
1 Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown [Changed by Somesh Jha]
1 Cryptography and Network Security Fourth Edition by William Stallings Lecture slides by Lawrie Brown [Changed by Somesh Jha]
Information Systems Security 3. Chapter 2 – Classical Encryption Techniques Many savages at the present day regard their names as vital parts of themselves,
Symmetric Cipher Model Plaintext input 1- encryption algorithm 2- secret key Encryption Cipher text output Cipher text input 1- Decryption algorithm 2-
Chapter 2 – Classical Encryption Techniques. Symmetric Encryption or conventional / private-key / single-key sender and recipient share a common key all.
Cryptography and Network Security Chapter 2
Chapter 2 – Classical Encryption Techniques Many savages at the present day regard their names as vital parts of themselves, and therefore take great pains.
Network Security Lecture 13 Presented by: Dr. Munam Ali Shah.
1 Cryptography and Network Security Fourth Edition by William Stallings Lecture slides by Lawrie Brown [Changed by Somesh Jha]
Cryptography and Network Security Chapter 2 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
CIM Symmetric Ciphers 11 Classical Encryption Techniques Ch 2 of Third Edition Cryptography and Network Security by William Stallings Modified from.
1 Classical Encryption Techniques. 2 Symmetric cipher model –Cryptography –Cryptanalysis Substitution techniques –Caesar cipher –Monoalphabetic cipher.
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.
By Marwan Al-Namari & Hafezah Ben Othman Author: William Stallings College of Computer Science at Al-Qunfudah Umm Al-Qura University, KSA, Makkah 1.
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.
Prof. Wenguo Wang Network Information Security Prof. Wenguo Wang Tel College of Computer Science QUFU NORMAL UNIVERSITY.
Cryptography and Network Security Chapter 2 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
CSEN 1001 Computer and Network Security Amr El Mougy Mouaz ElAbsawi.
CS480 Cryptography and Information Security Huiping Guo Department of Computer Science California State University, Los Angeles 4. Traditional and Modern.
BINF 711 Amr El Mougy Alaa Gohar. Lecture (2) Cryptographic Tools.
Conventional Encryption Message Confidentiality
Part 2 By Dr. Shadi Masadeh
Communication Security
Cryptography and Network Security
Outline Some Basic Terminology Symmetric Encryption
Computer and Network Security
Conventional Encryption Message Confidentiality
“Classical Encryption Techniques”
Cryptographic Algorithms and Protocols
Information Security IT423
Presentation transcript:

CSCE 790G: Computer Network Security Chin-Tser Huang huangct@cse.sc.edu University of South Carolina

Cryptography Can be characterized by type of encryption operations used substitution / transposition / product number of keys used single-key or shared / two-key or public way in which plaintext is processed block / stream 8/28/2003

Security of Cryptography 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 (eg. time needed for calculations is greater than age of universe), the cipher cannot be broken 8/28/2003

Cryptographic Tools To Be Used Shared keys Public and private keys Hashing functions and message digest Nonces 8/28/2003

Symmetric Encryption Sender and receiver share a common key All classical encryption algorithms belong to this type Was only type prior to invention of public-key in 1970’s 8/28/2003

Basic 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) – restoring plaintext from ciphertext 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 8/28/2003

Types of Cryptanalytic Attacks Ciphertext only only know algorithm, ciphertext, and statistics can identify plaintext Known plaintext know/suspect plaintext & ciphertext Chosen plaintext select plaintext and obtain ciphertext Chosen ciphertext select ciphertext and obtain plaintext Chosen text select either plaintext or ciphertext to encrypt or decrypt 8/28/2003

Symmetric Cipher Model 8/28/2003

Requirements Two requirements for secure use of symmetric encryption a strong encryption algorithm a secret key K known only to sender and receiver Y = EK(X) X = DK(Y) Assume encryption algorithm is known Imply a secure channel used to distribute key 8/28/2003

Classical Substitution Ciphers Letters of plaintext are replaced by other letters, by numbers, or by symbols If plaintext is viewed as a sequence of bits, then substitution involves replacing plaintext bit patterns with ciphertext bit patterns 8/28/2003

Caesar Cipher Earliest known substitution cipher Invented by Julius Caesar First attested use in military affairs Replace each letter by letter three places down the alphabet For example, meet me after the toga party PHHW PH DIWHU WKH WRJD SDUWB 8/28/2003

Mechanism of Caesar Cipher 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 z 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 Or assign each letter a number 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 In general, Caesar cipher can be specified as C = E(p) = (p + k) mod (26) p = D(C) = (C – k) mod (26) 8/28/2003

Cryptanalysis of Caesar Cipher Only 26 possible ciphers “A” maps to “A”, “B”, ... “Z” Can easily break with brute-force cryptanalysis Given ciphertext, just try all 26 ciphers Need to recognize the original plaintext eg. break ciphertext "GCUA VQ DTGCM" 8/28/2003

Monoalphabetic Cipher Rather than just shifting the alphabet Can shuffle the letters arbitrarily Each letter in plain alphabet maps to a different random letter in cipher alphabet Hence key is 26 letters long For example, Plain: abcdefghijklmnopqrstuvwxyz Cipher: DKVQFIBJWPESCXHTMYAUOLRGZN Plaintext: ifwewishtoreplaceletters Ciphertext: WIRFRWAJUHYFTSDVFSFUUFYA 8/28/2003

Monoalphabetic Cipher Security Now have a total of 26!  4 x 1026 keys With so many keys, might think is secure Still has problem: natural language characteristics 8/28/2003

Language Characteristics and Cryptanalysis Letters are not equally commonly used In English, “E” is by far the most common letter, followed by “T”, “R”, “N”, “I”, “O”, “A”, “S” Other letters “Z”, “J”, “K”, “Q”, “X” are rarely used Have tables of single, double & triple letter frequencies 8/28/2003

English Letter Frequencies 8/28/2003

Cryptanalysis of Caesar Cipher and Monoalphabetic Cipher Fact: 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 For Caesar cipher, look for common peaks and 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 8/28/2003

Example Cryptanalysis Given ciphertext: UZQSOVUOHXMOPVGPOZPEVSGZWSZOPFPESXUDBMETSXAIZ VUEPHZHMDZSHZOWSFPAPPDTSVPQUZWYMXUZUHSX EPYEPOPDZSZUFPOMBZWPFUPZHMDJUDTMOHMQ Count relative letter frequencies Guess “P” and “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 but direct contacts have been made with political representatives of the viet cong in moscow 8/28/2003

Playfair Cipher Not even the large number of keys in a monoalphabetic cipher provides security One approach to improving security was to encrypt multiple letters Playfair cipher is an example 8/28/2003

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 M O N A R C H Y B D E F G I/J K L P Q S T U V W X Z 8/28/2003

Encrypting and Decrypting plaintext encrypted two letters at a time if a pair is a repeated letter, insert a filler like “X” eg. “balloon” encrypts as “ba lx lo on” 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” 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” 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) 8/28/2003

Security of Playfair Cipher Security much improved over monoalphabetic Have 26 x 26 = 676 digrams Would need a 676 entry frequency table to analyze (verses 26 for a monoalphabetic) Also need correspondingly more ciphertexts Can still be broken since still has much of plaintext structure 8/28/2003

Polyalphabetic Ciphers Use multiple cipher alphabets to improve security Make 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 8/28/2003

Vigenère Cipher Simplest polyalphabetic substitution cipher which effectively multiply Caesar ciphers Key is multiple letters long K = k1 k2 ... kd ith letter specifies ith alphabet to use Use each key letter as a Caesar cipher key Eg. using keyword deceptive key: deceptivedeceptivedeceptive plaintext: wearediscoveredsaveyourself ciphertext:ZICVTWQNGRZGVTWAVZHCQYGLMGJ 8/28/2003

Security of Vigenère Ciphers Have multiple ciphertext letters for each plaintext letter: obscure letter frequencies a bit Start with letter frequencies see if look monoalphabetic or not if not, need to determine number of alphabets Repetitions in ciphertext give clues to period Find same plaintext an exact period apart which results in the same ciphertext (could also be random fluke) Eg. repeated “VTW” in previous example suggests size of 3 or 9 8/28/2003

Autokey Cipher To eliminate periodic nature of keyword, prefix keyword to message as key Knowing keyword can recover the first few letters Use these in turn on the rest of the message Eg. given key deceptive key: deceptivewearediscoveredsav plaintext: wearediscoveredsaveyourself ciphertext:ZICVTWQNGKZEIIGASXSTSLVVWLA Still have frequency characteristics to attack 8/28/2003

One-Time Pad If use a truly random key as long as plaintext, cipher will be secure Unbreakable ciphertext bears no statistical relationship to the plaintext for any plaintext and any ciphertext there exists a key mapping one to other Can only use the key once Problems overhead of making large number pf random keys safe distribution of key 8/28/2003

Transposition Ciphers Hide message by rearranging order of letters Without altering the actual letters used Can recognize these since they have the same frequency distribution as the original text 8/28/2003

Rail Fence Cipher Write message letters out diagonally over a number of rows Then read off cipher row by row For example, 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 and get ciphertext as MEMATRHTGPRYETEFETEOAAT 8/28/2003

Row Transposition Ciphers A more complex scheme Write letters of message out in rows over a specified number of columns Then reorder the columns according to some key before reading off the rows Key: 3 4 2 1 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: TTNAAPTMTSUOAODWCOIXKNLYPETZ 8/28/2003

Product Ciphers Ciphers using substitutions or transpositions are not secure because of language characteristics Hence consider using several ciphers in succession to make it harder to break two substitutions make a more complex substitution, but still a substitution two transpositions make a more complex transposition, but still a transposition but a substitution followed by a transposition makes a new much harder cipher Significance: bridge from classical to modern ciphers 8/28/2003

Rotor Machines Before modern ciphers, rotor machines were most common product cipher Were widely used in WW2 German Enigma, Allied Hagelin, Japanese Purple Implement a very complex, varying substitution cipher Use a series of cylinders, each giving one substitution, which rotate and change after each letter was encrypted With 3 cylinders, have 263=17576 alphabets 8/28/2003

An Example of Rotor Machine 8/28/2003

Steganography An alternative to encryption Hide 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 8/28/2003

Next Class Block ciphers Modern symmetric encryption standard Read Chapter 3 Have a nice long weekend! 8/28/2003