11/21/2015 1. 2 Session Plan Overview of Classical encryption techniques: Symmetric cipher model Substitution Transposition Steganography.

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.
1 Day 04- Cryptography Acknowledgements to Dr. Ola Flygt of Växjö University, Sweden for providing the original slides.
Chapter 2 – Classical Encryption Techniques. Classical Encryption Techniques Symmetric Encryption Or conventional / private-key / single-key sender and.
Classical Encryption Techniques
Chapter 2 Basic Encryption and Decryption (part B)
Review What is security: history and definition Security policy, mechanisms and services Security models.
CPSC CPSC 3730 Cryptography Chapter 2 Classical Encryption Techniques.
Classical Encryption Techniques
Chapter 2 – Classical Encryption Techniques
Cryptography Week-6.
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.
Cryptography. Secret (crypto) Writing (graphy) –[Greek word] Practice and study of hiding information Concerned with developing algorithms for: –Conceal.
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.
Chapter 2 – Elementary Cryptography  Concepts of encryption  Cryptanalysis  Symmetric (secret key) Encryption (DES & AES)(DES & AES)  Asymmetric (public.
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.
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.
Symmetric-Key Cryptography
Module :MA3036NI Cryptography and Number Theory Lecture Week 3 Symmetric Encryption-2.
1 University of Palestine Information Security Principles ITGD 2202 Ms. Eman Alajrami.
Elementary Cryptography  Concepts of encryption  Symmetric (secret key) Encryption (DES & AES)(DES & AES)  Asymmetric (public key) Encryption (RSA)(RSA)
Data Security and Encryption (CSE348) 1. Lecture # 4 2.
Traditional Symmetric-Key Ciphers
1 University of Palestine Information Security Principles ITGD 2202 Ms. Eman Alajrami 2 nd Semester
Computer Security Cryptography. Cryptography Now and Before  In the past – mainly used for confidentiality  Today –Still used for confidentiality –Data.
Data Security and Encryption (CSE348) 1. Lecture # 3 2.
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.
Lecture 2 (Chapter 2) Classical Encryption Techniques Prepared by Dr. Lamiaa M. Elshenawy 1.
Computer Security (CS4800)
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.
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.
Computer Security By Rubel Biswas. Introduction History Terms & Definitions Symmetric and Asymmetric Attacks on Cryptosystems Outline.
Lecture 3 1. TRANSPOSITION CIPHERS 2 Transposition Ciphers now consider classical transposition or permutation ciphers these hide the message by rearranging.
CS480 Cryptography and Information Security Huiping Guo Department of Computer Science California State University, Los Angeles 4. Traditional and Modern.
@Yuan Xue Quick Review.
Row Transposition Ciphers
Communication Security
Introduction Of System Security
Cryptography.
Outline Some Basic Terminology Symmetric Encryption
Computer Security Chapter Two
Presentation transcript:

11/21/2015 1

2 Session Plan Overview of Classical encryption techniques: Symmetric cipher model Substitution Transposition Steganography

11/21/ Cryptography Crypto secret key public key cryptographic hashes Used for authentication, integrity protection, encryption

11/21/ plaintext - original message ciphertext - 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) - study of principles/ methods of deciphering ciphertext without knowing key cryptology - field of both cryptography and cryptanalysis

11/21/ Cryptography Crypto secret key public key cryptographic hashes Used for authentication, integrity protection, encryption

11/21/2015 6

7 Components of symmetric encryption Plain text Encryption algorithm Secret key Cipher text Decryption algorithm

11/21/2015 NETWORK SECURITY 8 Important factors of symmetric encryption Type of operations(substitution & transpositions) Number of keys used Processing mode ( block cipher & stream cipher) Attacks on encryption system Crypt analysis – To get plain text or key using algorithm Brute-force attack – Try every possible key to get plain text/key Cryptography + cryptanalysis = cryptology

11/21/2015 NETWORK SECURITY 9 Important factors of symmetric encryption Type of operations(substitution & transpositions) Number of keys used Processing mode ( block cipher & stream cipher) Attacks on encryption system Crypt analysis – To get plain text or key using algorithm Brute-force attack – Try every possible key to get plain text/key Cryptography + cryptanalysis = cryptology

11/21/2015 NETWORK SECURITY 10 Important factors of symmetric encryption Type of operations(substitution & transpositions) Number of keys used Processing mode ( block cipher & stream cipher) Attacks on encryption system Crypt analysis – To get plain text or key using algorithm Brute-force attack – Try every possible key to get plain text/key Cryptography + cryptanalysis = cryptology

11/21/2015 NETWORK SECURITY 11 ciphertext only only knows algorithm & ciphertext known plaintext know/suspect plaintext & ciphertext chosen plaintext select plaintext and obtain ciphertext chosen ciphertext select ciphertext and obtain plaintext chosen text select plaintext or ciphertext to en/decrypt

11/21/2015 NETWORK SECURITY 12 unconditional security no matter how much computer power or time 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

11/21/2015 NETWORK SECURITY 13 always possible to simply try every key most basic attack, proportional to key size assume either know / recognise plaintext Key Size (bits)Number of Alternative Keys Time required at 1 decryption/µs Time required at 10 6 decryptions/µs = 4.3  µs= 35.8 minutes2.15 milliseconds = 7.2  µs= 1142 years10.01 hours = 3.4  µs= 5.4  years 5.4  years = 3.7  µs= 5.9  years 5.9  years 26 characters (permutation) 26! = 4   µs= 6.4  years 6.4  10 6 years

11/21/2015 NETWORK SECURITY 14 Caesar cipher Mono alphabetic cipher Playfair cipher Ployalphabetic ciphers One-time pad

11/21/2015 NETWORK SECURITY 15 Each character of a message is replaced by a character three po- sition down in the alphabet. plaintext: are you ready ciphertext: DUH BRX UHDGB ciphertext can be expressed as c = E(3, p) = (p + 3) mod 26 where E() stands for encryption c = E(k, p) = (p + k) mod 26 The formula for decryption would be p = D(k, c) = (c − k) mod 26

11/21/2015 NETWORK SECURITY 16 In a monoalphabetic cipher, our substitution characters are a random permutation of the 26 letters of the alphabet: plaintext letters: a b c d e f..... substitution letters: t h i j a b..... Note that there are 26! permutations of the alphabet. That is a number larger than 4 × Pairs of adjacent characters are referred to as digrams, and triples of characters as trigrams.

11/21/2015 NETWORK SECURITY 17 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 followed by T,R,N,I,O,A,S other letters like Z,J,K,Q,X are fairly rare have tables of single, double & triple letter frequencies for various languages

11/21/2015 NETWORK SECURITY 18

11/21/2015 NETWORK SECURITY 19 In Playfair cipher, you first choose an encryption key. You then enter the letters of the key in the cells of a 5 × 5 matrix in a left to right fashion starting with the first cell at the top- left corner.

11/21/2015 NETWORK SECURITY 20 Rules you must insert a chosen “filler” letter (let’s say it is ‘x’) between any repeating letters in the plaintext. Two plaintext letters that fall in the same row of the 5 × 5 matrix are replaced by letters to the right of each in the row. Two plaintext letters that fall in the same column are replaced by the letters just below them in the column. Otherwise, for each plaintext letter in a pair, replace it with the letter that is in the same row but in the column of the other letter.

11/21/2015 NETWORK SECURITY 21 if a 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 problems in generation & safe distribution of key

11/21/2015 NETWORK SECURITY 22 Mapping is achieved permutation on plain text letters. Transposition means rearranging the order of appearance of the elements of the plaintext. Rail fence Row transposition

11/21/2015 NETWORK SECURITY 23 A very simple form of [transposition cipher] is the rail fence, named for its fencelike appearance, which is the result of aligning rows of letters, then shifting them. The key is the number of rails and the order in which they are taken off.

11/21/2015 NETWORK SECURITY 24 Three rows

11/21/2015 NETWORK SECURITY 25 a more complex transposition 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: 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

11/21/2015 NETWORK SECURITY 26 before modern ciphers, rotor machines were most common complex ciphers in use 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

11/21/2015 NETWORK SECURITY 27

11/21/2015 NETWORK SECURITY 28

11/21/2015 NETWORK SECURITY 29 Steganography is the science of hiding information One of the oldest stego schemes was to shave the head of a messenger and tattoo a message on the messenger's head. After the hair grows back, the messenger can be sent to the intended recipient, where the messenger's head can be shaved and the message recovered. This method is decidingly clever, patient, and very low-tech, and goes right to the heart of steganography's literal meaning of "covered writing."

11/21/2015 NETWORK SECURITY 30 Character marking – visible at an angle to bright light Invisible ink – visible on heat or chemical is applied pin punctures – visible in front of light Type writer correction ribbon – visible in strong light Deliberate misspelling to mark words in the message Use of small changes in spacing to indicate significant letters or words in a hidden message Use of a slightly different font in a typeset message to indicate the hidden letters Not only restricted to written forms of communication

11/21/2015 NETWORK SECURITY 31 Consider this cablegram that might have been sent by a journalist/spy from the U.S. to Europe during World War I: PRESIDENT'S EMBARGO RULING SHOULD HAVE IMMEDIATE NOTICE. GRAVE SITUATION AFFECTING INTERNATIONAL LAW. STATEMENT FORESHADOWS RUIN OF MANY NEUTRALS. YELLOW JOURNALS UNIFYING NATIONAL EXCITEMENT IMMENSELY. The first letters of each word form the character string: PERSHINGSAILSFROMNYJUNEI. A little imagination and some spaces yields the real message: PERSHING SAILS FROM NY JUNE I.

11/21/2015 NETWORK SECURITY 32 Template (e.g., a piece of paper with holes cut in it) or a set of preselected locations on the page to hide a message THE MOST COMMON WORK ANIMAL IS THE HORSE. THEY CAN BE USED TO FERRY EQUIPMENT TO AND FROM WORKERS OR TO PULL A PLOW. BE CAREFUL, THOUGH, BECAUSE SOME HAVE SANK UP TO THEIR KNEES IN MUD OR SAND, SUCH AS AN INCIDENT AT THE BURLINGTON FACTORY LAST YEAR. BUT HORSES REMAIN A SIGNIFICANT FIND. ON A FARM, AN ALTERNATE WORK ANIMAL MIGHT BE A BURRO BUT THEY ARE NOT AS COMFORTABLE AS A TRANSPORT ANIMAL Applying a template or rule as to which words to read to this message might yield the following: HORSE FERRY SANK IN BURLINGTON FIND ALTERNATE TRANSPORT

11/21/2015 NETWORK SECURITY 33

11/21/2015 NETWORK SECURITY 34

11/21/2015 NETWORK SECURITY 35