1 Classical Encryption Techniques. 2 Symmetric cipher model –Cryptography –Cryptanalysis Substitution techniques –Caesar cipher –Monoalphabetic cipher.

Slides:



Advertisements
Similar presentations
CLASSICAL ENCRYPTION TECHNIQUES
Advertisements

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
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
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.
Chapter 2 Basic Encryption and Decryption. csci5233 computer security & integrity 2 Encryption / Decryption encrypted transmission AB plaintext ciphertext.
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.
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.
Rather than just shifting the alphabet Could shuffle (jumble) the letters arbitrarily Each plaintext letter maps to a different random cipher text letter.
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.
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.
Lecture 2 (Chapter 2) Classical Encryption Techniques Prepared by Dr. Lamiaa M. Elshenawy 1.
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.
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.
CS480 Cryptography and Information Security Huiping Guo Department of Computer Science California State University, Los Angeles 4. Traditional and Modern.
@Yuan Xue Quick Review.
CRYPTOGRAPHY G REEK WORD MEANING “ SECRET WRITING ”
Substitution Ciphers.
Chapter 2 Basic Encryption and Decryption
Conventional Encryption Message Confidentiality
Communication Security
Cryptography and Network Security
Introduction Of System Security
Outline Some Basic Terminology Symmetric Encryption
Conventional Encryption Message Confidentiality
“Classical Encryption Techniques”
Cryptographic Algorithms and Protocols
Information Security IT423
Presentation transcript:

1 Classical Encryption Techniques

2 Symmetric cipher model –Cryptography –Cryptanalysis Substitution techniques –Caesar cipher –Monoalphabetic cipher –Polyalphabetic cipher –One time pad –Playfair cipher Topic

3 Symmetric Encryption Referred to as conventional / private-key / single-key sender and recipient share a common key all classical encryption algorithms are private-key most widely used

4 Some Basic Terminology 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

5 Symmetric Cipher Model Simplified model of conventional encryption

6 Requirements two requirements for secure use of symmetric encryption: –a strong encryption algorithm –a secret key known only to sender / receiver mathematically have: Y = E K (X) X = D K (Y) assume encryption algorithm is known

7 Cryptography characterize cryptographic system by: –type of encryption operations used Two general principles: –substitution / transposition –Product system (multiple stages..) –number of keys used single-key or private / two-key or public –way in which plaintext is processed block / stream

8 Cryptanalysis Two general approaches to attacking a conventional encryption scheme: –Cryptanalysis or cryptanalytic attack –brute-force attack

9 More Definitions Encryption scheme is unconditional secure –Cipher text generated by the scheme does not contain enough information to determine corresponding plaintext. –the cipher text cannot be broken. –no matter how much computer power or time is available. Encryption scheme is computational secure –given limited computing resources so the cipher cannot be broken

10 Brute Force Search always possible to simply try every key most basic attack, proportional to key size Key Size (bits) Number of Alternative Keys Time required at 1 decryption/µs Time required at 10 6 decryptions/µs = 4.3 x µs= 35.8 minutes 2.15 milliseconds = 7.2 x µs= 1142 years10.01 hours = 3.4 x µs= 5.4 x years 5.4 x years = 3.7 x µs= 5.9 x years 5.9 x years 26 characters (permutation ) 26! = 4 x x µs= 6.4 x years 6.4 x 10 6 years

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

12 Caesar Cipher Also known substitution cipher first attested use in military. replaces each letter by 3rd letter further down the alphabet example: m e e t m e P H H W P H

13 Caesar Cipher mathematically give each letter a number abcdefghijkl m n o p q r s t u v w x y z We 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 then have Caesar cipher as: c = E(p) = (p + k) mod (26) p = D(c) = (c – k) mod (26)

14 Cryptanalysis of Caesar Cipher a brute force cryptanalysis easily decrypt. Encryption and decryption algorithms are known. Try all the 25 possible keys The language of the plaintext is known and easily recognizable.

15 Monoalphabetic Cipher Caesar cipher is one of the example of monoalphabetic cipher. Monoalphabetic cipher is special substitution technique. each plaintext letter maps to a different random ciphertext letter So there are 26! Different cipher alphabets (4 x ) possible. Plain: abcdefghijklmnopqrstuvwxyz Cipher: DKVQFIBJWPESCXHTMYAUOLRGZN Plaintext: ifwewishtoreplaceletters Ciphertext: WIRFRWAJUHYFTSDVFSFUUFYA

16 Monoalphabetic Cipher Security Caesar cipher is far from secure because only 25 possible keys. now have a total of 26! = 4 x keys with so many keys, might think is secure If the cryptanalyst knows the nature of the plaintext(non compressed English text) then analyst can exploit the data. Relative frequency of cipher text letters can be determined and compare to a standard frequency distribution for English.

17 English Letter Frequencies

18 Example Cipher text: UZQSOVUOHXMOPVGPZW…………. Relative frequency of latter in percentage is: P: e Z: t S,U,O,M,H  {a,h,i,n,o,r,s} probably frequency. ZW: three time repeated in above cipher. so, z with ‘t’ and w with ‘h’ so ZW->th next, ZWP -> the next, ZWSZ -> th_t

19 Polyalphabetic Ciphers Monoalphabetic cipher encoded using only one fixed alphabet. Spaces between words are still there, these are fairly easy to break. So improve security use multiple cipher alphabets for same plaintext letters. make cryptanalysis harder with more alphabets to guess. One such cipher is the famous vigenere cipher.

20 Vigenère Cipher simplest polyalphabetic substitution cipher Pick a keyword (example: MEC) Write this keyword on top of the plaintext and repeat it many times if necessary. To retrieve cipher text of plain text use vigenere table. (row: keys letter and column: plaintext letter). Keyword: M E C M E C M E C M E C M E C Plaintext: w e n e e d m o r e m o n e y Cipher : I I P Q I F Y S T Q Q Q Z I A

21 Security of Vigenère Ciphers have multiple ciphertext letters for each plaintext letter hence letter frequencies are hidden. start with letter frequencies –see if look monoalphabetic or not if not, then need to determine number of alphabets, since then can attach each

22 One-Time Pad (Vernam Cipher) The cipher will be more secure. Key need not be repeated. (Random Key) The key is used to encrypt and decrypt a single message and then discarded. Key length is same as plaintext msg. It is unbreakable scheme. It offer complete security but in practice, has two fundamental difficulties: –Problem of making large quantities of random keys. –Problem of key distribution & protection.

23 One-Time Pad Plain text: H O W A R E Y O U OTP: N C B T Z Q A R X Initial total: Mod 26: Ciphertext: U Q X T Q U Y F R

24 Playfair cipher Playfair is multiple letter encryption cipher It is based on the use of a 5 x 5 matrix of letters constructed using keyword. Example: keyword: “playfair is a diagram cipher” PLAYF I/JRSDG MCHEB KNOQT UVWXZ (p1,p2)  (c1,c2)

25 Playfair cipher Plaintext is encrypted two letters at a time based on following rules: me et at fi ve pm be hi nd pl ab. p1 & p2 in distinct row & column, then define the corner of a submatrix. Ex: ET  QB. P1 & p2 in common row, c1 is defined as the character immediately to the right of p1 & c2 is defined right of p2. Ex: ME  CB. p1,p2 in same column, then character immediately (circularly) below them are c2 & c3. Ex: PM  IK. p1=p2 then infrequent plaintext character(such as x) inserted between them and regrouped plaintext. Ex: balloon  ba lx lo on

26 Hill cipher Another Multi letter cipher technique. Take m successive plaintext letters and substitute for them m cipher text letters. The substitution is determined by m linear equations in which each character is assigned a numerical value. (a=0,b=1,c=2,…….z=25)

27 Transposition Ciphers these hide the message by rearranging the letter order without altering the actual letters used It can recognise these since have the same frequency distribution as the original text

28 Rail Fence cipher Text is written down as sequence of diagonal. Here we consider depth of the diagonal or number of rows for arranging letters. Next, read the letters row by row which gives cipher text. eg. write message out as: (depth=2) 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

29 Rail Fence cipher eg. write message out as: (depth=3) 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 mtaehoptemfregayeetttar m t a e h o p t e m f r e g a y e e t t t a r

30 Row Transposition Ciphers a more complex transposition is to write the message in a rectangle row by row. Next, read the message column by column but specify which order of column to convert plaintext data into cipher text. write letters of message out in rows over a specified number of columns. 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

31 Row Transposition Ciphers In double transposition method convert single transposition cipher text into another cipher text. Key: Plaintext: t t n a a p t m t s u o a o d w c o i x k n l y p e t z Ciphertext: NSCYAUOPTTWLTMDNAOIEPAXTTOKZ

32 Summary have considered: –classical cipher techniques and terminology –monoalphabetic substitution ciphers –cryptanalysis using letter frequencies –polyalphabetic ciphers –transposition ciphers –product ciphers and rotor machines