Computer and Data Security 4th Class

Slides:



Advertisements
Similar presentations
Using Cryptography to Secure Information. Overview Introduction to Cryptography Using Symmetric Encryption Using Hash Functions Using Public Key Encryption.
Advertisements

CRYPTOGRAPHY Lecture 5. 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 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 A C D E F G H I J K L M.
CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.
1 Codes, Ciphers, and Cryptography-Ch 3.1 Michael A. Karls Ball State University.
Chapter 2 – Classical Encryption Techniques
Polyalphabetic Substitution Ciphers. First Steps Towards Complexity  If one alphabet is good, then two alphabets must be better!  By doubling the number.
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.
Chapter 2 Basic Encryption and Decryption. csci5233 computer security & integrity 2 Encryption / Decryption encrypted transmission AB plaintext ciphertext.
1st Class Discrete Structures الهياكل المتقطعة أستاذة المادة: م. م
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
Week 2 - Wednesday.  What did we talk about last time?  Encryption  Shift ciphers  Transposition ciphers.
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.
Hill Cipher Developed by the mathematician Lester Hill in The encryption algorithm takes m successive plain text and substitute for them m cipher.
Cryptography Data communications and networks Momina Tariq: Ambreen Sohail: Data Communications and Networks.
Topic 21 Cryptography CS 555 Topic 2: Evolution of Classical Cryptography CS555.
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.
ITMS – 3153 Information Systems Security
1 Chapter 2-1 Conventional Encryption Message Confidentiality.
Section 2.7: The Friedman and Kasiski Tests Practice HW (not to hand in) From Barr Text p. 1-4, 8.
Symmetric-Key Cryptography
Module :MA3036NI Cryptography and Number Theory Lecture Week 3 Symmetric Encryption-2.
Polyalphabetic CIPHERS Linguistics 484. Summary The idea How to recognize: index of coincidence How many alphabets: Kasiski.
Cryptography Lecture 2: Classic Ciphers Piotr Faliszewski.
Cryptography Part 1: Classical Ciphers Jerzy Wojdyło May 4, 2001.
Elementary Cryptography  Concepts of encryption  Symmetric (secret key) Encryption (DES & AES)(DES & AES)  Asymmetric (public key) Encryption (RSA)(RSA)
Section 2.5: Polyalphabetic Substitutions Practice HW (not to hand in) From the Barr Text p. 118 # 1-6.
Traditional Symmetric-Key Ciphers
Section 2.2: Affine Ciphers; More Modular Arithmetic Shift ciphers use an additive key. To increase security, we can add a multiplicative parameter. –For.
Section 2.5 Polyaphabetic Substitutions
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.
Vigenère Tableau Reference –Matt Bishop, Computer Security, Addison Wesley, 2003.
Vigenére Cipher Kimberly Chiffens & Maria Jannelli.
Lecture 4 DECIPHERING CLASSICAL CIPHER SYSTEMS By: NOOR DHIA AL- SHAKARCHY
1 Introduction CS 303 Algorithmic Number Theory and Cryptography Jeremy R. Johnson.
Substitution Ciphers Reference –Matt Bishop, Computer Security, Addison Wesley, 2003.
1 Classical Encryption Techniques. 2 Symmetric cipher model –Cryptography –Cryptanalysis Substitution techniques –Caesar cipher –Monoalphabetic cipher.
Prof. Wenguo Wang Network Information Security Prof. Wenguo Wang Tel College of Computer Science QUFU NORMAL UNIVERSITY.
Lecture 2 Classical Cipher System SIMPLE SUBSTITUTION CIPHERS By: NOOR DHIA AL- SHAKARCHY
COMPUTER AND NETWORK SECURITY First of all, an introduction to the field of computer security and some of relevant issues are presented. Then, a background.
CRYPTOGRAPHY G REEK WORD MEANING “ SECRET WRITING ”
Chapter 2 Basic Encryption and Decryption
Introduction CS 303 Algorithmic Number Theory and Cryptography
Conventional Encryption Message Confidentiality
Asad Gondal Ali Haider Mansoor
Prepared by: Sameer Ali Aljaroodi, Tutor: Mr. Ahmad Kananh
Cryptography and Network Security
Computer and Data Security 4th Class
Information and Computer Security CPIS 312 Lab 2
History and Background Part 3: Polyalphabetic Ciphers
Polyalphabetic Ciphers
Taehyung Kim HPC Lab. POSTECH
Outline Some Basic Terminology Symmetric Encryption
Cryptography Lecture 2.
Conventional Encryption Message Confidentiality
A Technical Seminar Presentation CLASSICAL CRYPTOGRAPHY
Cryptography II Jagdish S. Gangolly School of Business
Encryption and Decryption
Cryptography: Cesar Cipher
Cryptography and Cryptanalysis
Digital Communications
Traditional Symmetric-Key Ciphers
Mixed Alphabet Keyword
Running Key Cipher The security of polyalphabetic substitution cipher reside in key length. In running-key cipher, the length of key must be equal the.
Double Transpositions
Homophonic Substitution Cipher
Symmetric Encryption or conventional / private-key / single-key
Presentation transcript:

Computer and Data Security 4th Class 2017-2018 lec.3

Polyalphabetic In this type of cipher, the relationship between the ciphertext substitution for plaintext symbols is variable. more than one substitution alphabet is used. This makes cryptanalysis used more alphabets to guess. Polyalphabetic substitution cipher systems includes Vigener cipher Beaufort cipher Running key cipher

Vigenere cipher Popular form of periodic substitution cipher based on shifted alphabets is called Vigenere cipher. The Vigenere cipher uses multiple mixed alphabets, each is a shift cipher. The key is m letters long (usually a word). Use each shift in turn to encrypt one letter, repeating from the start after m letters in the plaintext. The number of possible keys in the Vigenere Cipher is 26m Hw// Explain why the number of possible keys in the Vigenere Cipher is 26m Define K=ki...kd, where ki (i = 1, . . . , d) gives the amount of shift in the ith alphabet; that is, C = (p + ki) mod n.

The encipherment of the word RENAISSANCE under the key BAND is shown next: M =RENA ISSA NCE K =BAND BAND BAN Ek(M ) =SEAD JSFD OCR . In this example, the first letter of each four-letter group is shifted (mod 26) by 1, the second by 0, the third by 13, and the fourth by 3. Ex2: m = 5 and the key is fishy. Find the ciphertext for the following plaintext: ericthehalibut. Ciphertxt: ? Ex3: m = 6 and the key is cipher. Find the plaintext for the following received message: vpxzgiaxivwpubttmjpwizitwzt.

Beaufort cipher This cipher similar to Vigener cipher ,where, the key is specified by a sequence of the letters, K=k1, k2,……..,kd, where ki(i=1,2,….,d) gives the amount of shift in the ith alphabet. Beaufort cipher can be computed as following: Ci = (ki - pi) mod n. Note that the same function can be used to decipher; that is, for ciphertext letter ci, pi = (ki - Ci) mod n. encrypt the following message using key BAND M =RENA ISSA NCE K =BAND BAND BAN EK(M ) =kw……

H.W encrypt the following message using key BAN M =RENA ISSA NCE K =BAND BAND BAN EK(M ) =

Variant Beaufort cipher Variant Beaufort cipher is equivalent to a Vigenere cipher. The Variant Beaufort cipher is inverse of the Vigenere cipher. The Variant Beaufort cipher uses the substitution C = (pi - ki) mod n. encrypt the following message using key BAN M =RENA ISSA NCE K =BAND BAND BAN EK(M ) = DK(M ) =

Running key cipher The security of a substitution cipher generally increases with the key length. In a running-key cipher, the key is as long as the plaintext message (assuming the key does not repeat). One method uses the text in a book (or any other document) as a key sequence in a substitution cipher based on shifted alphabets (i.e., a nonperiodic Vigenere cipher). The key is specified by the title of the book and starting position (section, paragraph, etc.). Given the starting key: "Cryptography and Data Security, Section 2.3.1, paragraph 2," the plaintext message "THE TREASURE IS BURIED...“ is enciphered as M = THETREASUREISBURIED... K = THESECONDCI PHERISAN... EK(M ) = MOILVGOFXTMXZFLZAEQ...

Cont… Because perfect secrecy is possible using key sequences as long as the messages they encipher, one might expect a running key cipher to be unbreakable.