© G. Dhillon, IS Department Virginia Commonwealth University Principles of IS Security Cryptography and Technical IS Security.

Slides:



Advertisements
Similar presentations
CLASSICAL ENCRYPTION TECHNIQUES
Advertisements

Using Cryptography to Secure Information. Overview Introduction to Cryptography Using Symmetric Encryption Using Hash Functions Using Public Key Encryption.
Cryptology Terminology and Early History. Cryptology Terms Cryptology –The science of concealing the meaning of messages and the discovery of the meaning.
Cryptology  Terminology  plaintext - text that is not encrypted.  ciphertext - the output of the encryption process.  key - the information required.
EEC 688/788 Secure and Dependable Computing Lecture 4 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University
Cryptography Cryptography: art or science of keeping messages secret Cryptology: branch of mathematics that studies the mathematical foundations of cryptographic.
Classical Cryptography
1 Day 04- Cryptography Acknowledgements to Dr. Ola Flygt of Växjö University, Sweden for providing the original slides.
CYPHER INDEX n Introduction n Background n Demo INTRODUCTION n Cypher is a software toolkit designed to aid in the decryption of standard (historical)
Chapter 2 Basic Encryption and Decryption (part B)
CPSC CPSC 3730 Cryptography Chapter 2 Classical Encryption Techniques.
CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.
Cryptographic Algorithms Course information General Concepts Introductory examples Terminology Classical cryptography Cryptanalysis.
Classical Encryption Techniques
L1.1. An Introduction to Classical Cryptosystems Rocky K. C. Chang, February 2013.
Chapter 2 – Classical Encryption Techniques
3.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 3 Traditional Symmetric-Key Ciphers.
Cryptanalysis of the Vigenere Cipher Using Signatures and Scrawls To break a Vigenere cipher you need to know the keyword length. – The Kasiski and Friedman.
Section 2.4 Transposition Ciphers Practice HW (not to hand in) From Barr Text p. 105 #
Chapter 2 Basic Encryption and Decryption. csci5233 computer security & integrity 2 Encryption / Decryption encrypted transmission AB plaintext ciphertext.
Section 2.2: Affine Ciphers; More Modular Arithmetic Practice HW (not to hand in) From Barr Textbook p. 80 # 2a, 3e, 3f, 4, 5a, 7, 8 9, 10 (Use affinecipherbreaker.
A Technical Seminar Presentation CLASSICAL CRYPTOGRAPHY
MAT 1000 Mathematics in Today's World Winter 2015.
Chapter 2 – Elementary Cryptography  Concepts of encryption  Cryptanalysis  Symmetric (secret key) Encryption (DES & AES)(DES & AES)  Asymmetric (public.
Section 2.1: Shift Ciphers and Modular Arithmetic The purpose of this section is to learn about modular arithmetic, which is one of the fundamental mathematical.
Computer Security coursework 2 Dr Alexei Vernitski.
Lec. 5 : History of Cryptologic Research II
Topic 21 Cryptography CS 555 Topic 2: Evolution of Classical Cryptography CS555.
Cryptography and Network Security (CS435) Part Two (Classic Encryption Techniques)
Day 18. Concepts Plaintext: the original message Ciphertext: the transformed message Encryption: transformation of plaintext into ciphertext Decryption:
Chapter 17 Security. Information Systems Cryptography Key Exchange Protocols Password Combinatorics Other Security Issues 12-2.
Section 2.1: Shift Ciphers and Modular Arithmetic Practice HW from Barr Textbook (not to hand in) p.66 # 1, 2, 3-6, 9-12, 13, 15.
CIT 380: Securing Computer SystemsSlide #1 CIT 380: Securing Computer Systems Classical Cryptography.
1 Chapter 2-1 Conventional Encryption Message Confidentiality.
Symmetric-Key Cryptography
Module :MA3036NI Cryptography and Number Theory Lecture Week 3 Symmetric Encryption-2.
2002 Networking Operating Systems (CO32010) 1. Operating Systems 2. Processes and scheduling 3.
9/03/15UB Fall 2015 CSE565: S. Upadhyaya Lec 2.1 CSE565: Computer Security Lecture 2 Basic Encryption & Decryption Shambhu Upadhyaya Computer Science &
Cryptography Lecture 2: Classic Ciphers Piotr Faliszewski.
Introduction to Ciphers Breno de Medeiros. Cipher types From “Cipher”, Wikipedia article.
Elementary Cryptography  Concepts of encryption  Symmetric (secret key) Encryption (DES & AES)(DES & AES)  Asymmetric (public key) Encryption (RSA)(RSA)
Classical Crypto By: Luong-Sorin VA, IMIT Dith Nimol, IMIT.
Cryptography (Traditional Ciphers)
1 Cryptanalysis Four kinds of attacks (recall) The objective: determine the key ( Herckhoff principle ) Assumption: English plaintext text Basic techniques:
Traditional Symmetric-Key Ciphers
Security in Computing Cryptography (Traditional Ciphers)
Data Security and Encryption (CSE348) 1. Lecture # 3 2.
24-Nov-15Security Cryptography Cryptography is the science and art of transforming messages to make them secure and immune to attacks. It involves plaintext,
Section 2.2: Affine Ciphers; More Modular Arithmetic Shift ciphers use an additive key. To increase security, we can add a multiplicative parameter. –For.
MAT 1000 Mathematics in Today's World Winter 2015.
Encryption CS110: Computer Science and the Internet.
Introduction to Cryptography Lecture 8. Polyalphabetic Substitutions Definition: Let be different substitution ciphers. Then to encrypt the message apply.
Lecture 4 Page 1 CS 236 Online Basic Encryption Methods Substitutions –Monoalphabetic –Polyalphabetic Permutations.
Vigenére Cipher Kimberly Chiffens & Maria Jannelli.
Network Security Lecture 13 Presented by: Dr. Munam Ali Shah.
Introduction to Cryptography Lecture 4. Caesar Cipher Gaius Julius Caesar (100 B.C.- 44 B.C.) General Politician Dictator of Rome Creator of Caesar Cipher.
Substitution Ciphers Reference –Matt Bishop, Computer Security, Addison Wesley, 2003.
Chapter Two: Classic Cryptography
CS480 Cryptography and Information Security Huiping Guo Department of Computer Science California State University, Los Angeles 4. Traditional and Modern.
CRYPTOGRAPHY G REEK WORD MEANING “ SECRET WRITING ”
Substitution Ciphers.
CSE565: Computer Security Lecture 2 Basic Encryption & Decryption
Chapter 2 Basic Encryption and Decryption
Asad Gondal Ali Haider Mansoor
A Technical Seminar Presentation CLASSICAL CRYPTOGRAPHY
Cryptography: Cesar Cipher
Permutation Ciphers Instead of substituting different characters, scramble up the existing characters Use algorithm based on the key to control how they’re.
Presentation transcript:

© G. Dhillon, IS Department Virginia Commonwealth University Principles of IS Security Cryptography and Technical IS Security

© G. Dhillon, IS Department Virginia Commonwealth University The process

© G. Dhillon, IS Department Virginia Commonwealth University Time required for key search Key size in bitsNo of alternative keys Time required to decrypt 1 key per microsecondDecryption rate: 1 million keys per microsecond minutes2.15 milliseconds years10 hours x years5.4 x years x years5.9 x years

© G. Dhillon, IS Department Virginia Commonwealth University Basics of cryptanalysis A 0 B 1 C 2 D 3 E 4 F 5 G 6 H 7 I 8 J 9 K 10 L 11 M 12 N 13 O 14 P 15 Q 16 R 17 S 18 T 19 U 20 V 21 W 22 X 23 Y 24 Z 25

© G. Dhillon, IS Department Virginia Commonwealth University Modular Arithmetic Representation of a letter by a number code allows for performing arithmetic to the operation. This form of arithmetic is called modular, where instances such as P + 2 would equal R or Z + 1 equals A would occur. Since the addition wraps around from one end to the other, every result would be between 0 and 25. This form of modular arithmetic is written as mod n. And n is a number in the range 0≤result<n. In net effect the result is the remainder by n.

© G. Dhillon, IS Department Virginia Commonwealth University Example As an example, 53 mod 26 and alternative ways of arriving at the result: 53 mod 26 would be 53 divided by 26, with the remainder being the result, which in this case would be 26 time 2 equals 52 and remainder 1 or Count 53 ahead of A or 0 in the above representation and each time after crossing Z or 25 return to position A or 0. This will result in arriving at B or 1, which is the result. (Note: in the first count begin at 0).

© G. Dhillon, IS Department Virginia Commonwealth University Substitution Caesar Cipher, each letter is translated to a letter that appears after a fixed number of letters in the text. It is said that Caesar used to shift 3 letters. Thus a plaintext A would be d in ciphertext (Note: capital letters are generally used to depict plaintext and ciphertext is in lower text). Based on the Caesar Cipher, a plaintext word such as LONDON would become orqgrq.

© G. Dhillon, IS Department Virginia Commonwealth University Example using richmond 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 r i c h m o n d a b c e f g j k l p q s t u v w x y

© G. Dhillon, IS Department Virginia Commonwealth University Vigenère Cipher cont. The modern Vigenère tableau

© G. Dhillon, IS Department Virginia Commonwealth University Exercise Encrypt: IT WAS THE BEST OF TIMES IT WAS THE WORST OF TIMES And the key word used is KEYWORD.

© G. Dhillon, IS Department Virginia Commonwealth University Cryptanalysis Finding patterns. In order to use this method, one needs to identify all repeated patterns in the ciphertext. Clearly for plaintext to be enciphered twice, the key needs to go through a number of rotations. Any patterns over three characters is certainly not accidental. Factoring distances between repeated bigrams. Kasaki method suggests that the distance between the repeated patterns must be a multiple of the keyword length. For each instance, we write down starting positions and then compute the distance between successive position Bigram Location Distance Factors wg =17 1, 17 co =28 1, 2, 7 qp =7 1, 7 Interpretation. By factoring distances between bigrams helps in interpreting or narrowing down the search for a keyword, which can then be used to decrypt the plaintext message. In our example above the common factors are 1 and 7. Clearly there is less likelihood of a 1 character keyword. This narrows down our task of figuring out the keyword (Note: the keyword used in the above example is 7 characters long KEYWORD).

© G. Dhillon, IS Department Virginia Commonwealth University Transpositions In this case characters of plaintext are rearranged into columns In this case characters of plaintext are rearranged into columns. As an example, the message IT WAS THE BEST OF TIMES IT WAS THE WORST OF TIMES would be written as: I T W A S T H E B E S T O F T I M E S I T W A S T H E W O R S T O F T I M E S X The ciphertext for this message would be: itsi this thtm wetm weoe awoe seti trtx

© G. Dhillon, IS Department Virginia Commonwealth University Digrams In any language there are certain letters that have a high frequency of appearing together. These are referred to as digrams. For example, the ten most common digrams in English language are: EN, RE, ER, NT, TH, ON, IN, TF, AN and OR. The ten most common trigrams are: ENT, ION, AND, ING, IVE, TIO, FOR, OUR, THI, ONE.

© G. Dhillon, IS Department Virginia Commonwealth University

© G. Dhillon, IS Department Virginia Commonwealth University DES

© G. Dhillon, IS Department Virginia Commonwealth University Details of the cycle