Prof. Wenguo Wang Network Information Security Prof. Wenguo Wang Tel. 3980465 College of Computer Science QUFU NORMAL UNIVERSITY.

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.
CSCE 790G: Computer Network Security
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
SYMPATRIC ENCRYPTION L.Tahani Al jehani. Introduction  Definition  Cryptography, a word with Greek origins, means “secret writing”.  It refers to the.
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.
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
Mekanisme security & Crytography. Cryptography ≠Security Cryptography may be a component of a secure system Adding cryptography may not make.
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.
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.
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.
Cryptography.
Conventional Encryption Message Confidentiality
Communication Security
Cryptography and Network Security
Lecture Classical Encryption Techniques Dr. Nermin Hamza
Introduction Of System Security
CSCI-235 Micro-Computer Applications
Outline Some Basic Terminology Symmetric Encryption
Computer and Network Security
Conventional Encryption Message Confidentiality
Cryptographic Algorithms and Protocols
Information Security IT423
Presentation transcript:

Prof. Wenguo Wang Network Information Security Prof. Wenguo Wang Tel College of Computer Science QUFU NORMAL UNIVERSITY

Chapter 2 Classical Encryption Techniques

Classical Encryption 1. conventional --- was the only type prior to 1970’s 2. symmetric --- sender and receiver share a common private key 3. single-key --- only one key exists in the system

Some Basic Terminology 1. plaintext - original message 2. ciphertext - coded message 3. cipher - an algorithm for transforming plaintext into ciphertext 4. key - info used in a cipher known only to sender/receiver 5. encipher (encrypt) - converting plaintext to ciphertext 6. decipher (decrypt) - recovering plaintext from ciphertext 7. cryptography - study of encryption methods 8. cryptanalysis - study of decryption methods 9. Cryptology = cryptography + cryptanalysis

Symmetric Cipher Model

Classification Types of ciphers: encryption operations used substitution / transposition / product number of keys used single-key / two-key way in which plaintext is processed block / stream

Cryptanalysis 1. objective to recover key (not just message) 2. general approaches: cryptanalytic attack brute-force attack

Brute Force Search 1. always possible to simply try every key 2. most basic attack 3. cost proportional to key size 4. assume you recognise plaintext

More Definitions 1. 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 2. computational security given limited computing resources, the cipher cannot be broken

Classical Substitution Ciphers 1. where letters of plaintext are replaced by other letters or numbers or symbols 2. if plaintext is viewed as a sequence of bits, then substitution is about replacing plaintext bit patterns with new ciphertext bit patterns

Caesar Cipher 1. earliest known substitution cipher 2. invented by Julius Caesar 3. first attested use in military affairs 4. replaces each letter by 3rd letter on Example: meet me after the toga party PHHW PH DIWHU WKH WRJD SDUWB

Caesar Cipher 1. now mathematically give each letter a number: A=0, B=1, C=2, D=3, … Y=24, Z=25 2. then write Caesar cipher as: c = E(p) = (p + k) mod (26) p = D(c) = (c – k) mod (26)

Cryptanalysis of Caesar Cipher 1. only have 26 possible ciphers where A maps to A, B, …, Y, Z respectively 2. could simply try each in turn to decipher ---- a typical brute force search e.g. To break ciphertext "GCUA VQ DTGCM" ---- Homework No.1 for today!

Monoalphabetic Cipher  rather than just shifting the alphabet, we could shuffle (jumble) the letters arbitrarily  each letter in plaintext maps to a different random letter in ciphertext  hence key is always 26 letters long e.g. Plain: abcdefghijklmnopqrstuvwxyz Cipher: DKVQFIBJWPESCXHTMYAUOLRGZN Given Plaintext: if we wish to replace letters Ciphertext: WIRFRWAJUHYFTSDVFSFUUFYA

Monoalphabetic Cipher Security 1. now have a total of 26! = 4 x 1026 keys 2. with so many keys, you might think it be secure? 3. but !!!WRONG!!! problem is language characteristics

Language Redundancy and Cryptanalysis Human languages are redundant ! e.g. in "th lrd s m shphrd shll nt wnt" Letters appear not with same frequencies 1. in English E is by far the most common letter, followed by T, R, N, I, O, A, S 2. other letters like Z,J,K,Q,X are fairly rare 3. we have tables of single, double & triple letter frequencies for various languages

English Letter Frequencies

Use in Cryptanalysis 1. key note - monoalphabetic substitution ciphers do not change relative letter frequencies 2. calculate letter frequencies for ciphertext 3. compare counts/plots against known values in Caesar cipher and guess 4. tables of common double/triple letters may help

Example Cryptanalysis 1. given ciphertext: UZQSOVUOHXMOPVGPOZPEVSGZWSZOPFPESXUDBMETSXAIZ VUEPHZHMDZSHZOWSFPAPPDTSVPQUZWYMXUZUHSX EPYEPOPDZSZUFPOMBZWPFUPZHMDJUDTMOHMQ 2. count relative letter frequencies (see text) 3. guess P & Z are e and t 4. guess ZW is “th” and hence ZWP is “the” 5. 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

Polyalphabetic Ciphers 1. polyalphabetic substitution ciphers can improve security by using multiple cipher alphabets 2. make cryptanalysis harder with more alphabets to guess and flatter frequency distribution 3. use a key to select which alphabet is used for each letter of the message 4. use each alphabet in turn and repeat from start after end of key is reached

Vigenère Cipher 1. simplest polyalphabetic substitution cipher 2. effectively multiple Caesar ciphers 3. key is multiple letters long K = k 1 k 2... k d 4. i th letter specifies i th alphabet to use 5. use each alphabet in turn and repeat from start after d letters in message 6. decryption simply works in reverse

Example of Vigenère Cipher 1. write the plaintext out 2. write the keyword repeatedly above it 3. use each key letter as a Caesar cipher key 4. encrypt the corresponding plaintext letter e.g. using the keyword deceptive key: deceptivedeceptivedeceptive plaintext: wearediscoveredsaveyourself ciphertext: ZICVTWQNGRZGVTWAVZHCQYGLMGJ

Security of Vigenère Ciphers 1. have multiple ciphertext letters for each plaintext letter 2. hence letter frequencies are obscured but not totally lost 3. how to decipher ? Start with checking letter frequencies to see if the pattern is monoalphabetic or not 4. if not, then need to determine number of alphabets, the length of the key

One-Time Pad 1. use a truly random key as long as the message, the cipher will be secure a One-Time pad 2. is unbreakable since ciphertext bears no statistical relationship to the plaintext 3. since for any plaintext & any ciphertext there exists a key mapping one to other 4. can only use the key once though 5. Problem: generation & distribution of the key

Transposition Ciphers 1. now consider classical transposition or permutation ciphers 2. these hide the message by rearranging the letter order 3. without altering the actual letters used 4. same frequency distribution as in the original text

Product Ciphers 1. ciphers using substitutions or transpositions are not secure because of language characteristics 2. hence consider using several ciphers in succession to make it safer, but: two substitutions make more complex substitution two transpositions make more complex transposition but a substitution followed by a transposition makes a new much harder cipher 3. bridge from classical to modern ciphers

Rotor Machines 1. before modern ciphers, rotor machines were most complex ciphers in use 2. widely used in WW2 German Enigma, Allied Hagelin, Japanese Purple 3. implemented a very complex, varying substitution cipher 4. used a series of cylinders, each giving one substitution, which rotated and changed after each letter was encrypted 5. with 3 cylinders have 26 3 =17576 alphabets

Hagelin Rotor Machine

Steganography ( ) Steganography ( 隐写术 ) 1. an alternative to encryption 2. 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 3. 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 polyalphabetic ciphers transposition ciphers product ciphers and rotor machines steganography