Vigenere Cipher For example, choose a word “GOLD” for a key. And, add “GOLDGOLDGOLD….” to your plaintext Plaintext: t o o m u c h h y p e Key : GOLDGOLDGOLD.

Slides:

Advertisements

Similar presentations

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.

Advertisements

Classical Cryptosystems Shift Ciphers (Caesar) y= x+k (mod 26) Affine Ciphers y=ax+b (mod 26) Vigenere Ciphers codes=(02,14,03,04,18) Substitution Ciphers.

CSCI283 Fall 2005 GWU All slides from Bishop’s slide set Stream Ciphers.

Announcements: Matlab: tutorial available at Matlab: tutorial available at

1 The AES block cipher Niels Ferguson. 2 What is it? Block cipher: encrypts fixed-size blocks. Design by two Belgians. Chosen from 15 entries in a competition.

CSE331: Introduction to Networks and Security Lecture 17 Fall 2002.

McGraw-Hill©The McGraw-Hill Companies, Inc., Security PART VII.

1 Day 04- Cryptography Acknowledgements to Dr. Ola Flygt of Växjö University, Sweden for providing the original slides.

Introduction to Symmetric Block Cipher Jing Deng Based on Prof. Rick Han’s Lecture Slides Dr. Andreas Steffen’s Security Tutorial.

Stream Ciphers 1 Stream Ciphers. Stream Ciphers 2 Stream Ciphers  Generalization of one-time pad  Trade provable security for practicality  Stream.

CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.

Computer Security CS 426 Lecture 3

Encryption Schemes Second Pass Brice Toth 21 November 2001.

Chapter 2 – Classical Encryption Techniques

Hybrid Cipher encryption Plain Text Key Cipher Text Key Plain Text IV Hybrid Cipher decryption Hybrid Cipher Note: IV used in encryption is not used in.

Block and Stream Ciphers1 Reference –Matt Bishop, Computer Security, Addison Wesley, 2003.

3.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 3 Traditional Symmetric-Key Ciphers.

1 Introduction to Codes, Ciphers, and Cryptography Michael A. Karls Ball State University.

EE5552 Network Security and Encryption block 4 Dr. T.J. Owens CEng MIET Dr T. Itagaki MIET, MIEEE, MAES.

Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 9: Cryptography.

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.

Cryptography Programming Lab

Security and Protection of Information, Brno Using quasigroups for secure encoding of file system Eliška Ochodková, Václav Snášel

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.

5.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 5 Introduction to Modern Symmetric-key Ciphers.

1 University of Palestine Information Security Principles ITGD 2202 Ms. Eman Alajrami 2 nd Semester

Códigos y Criptografía Francisco Rodríguez Henríquez A Short Introduction to Stream Ciphers.

Week 2 - Wednesday.  What did we talk about last time?  Encryption  Shift ciphers  Transposition ciphers.

Computer System Security CSE 5339/7339

Hill Cipher Developed by the mathematician Lester Hill in The encryption algorithm takes m successive plain text and substitute for them m cipher.

CS212: DATA STRUCTURES Lecture 10:Hashing 1. Outline 2  Map Abstract Data type  Map Abstract Data type methods  What is hash  Hash tables  Bucket.

Introduction to Stream Cipher Sayed Mahdi Mohammad Hasanzadeh Spring 2004.

One-Time Pad Or Vernam Cipher Sayed Mahdi Mohammad Hasanzadeh Spring 2004.

CS555Spring 2012/Topic 51 Cryptography CS 555 Topic 5: Pseudorandomness and Stream Ciphers.

Topic 21 Cryptography CS 555 Topic 2: Evolution of Classical Cryptography CS555.

1 Chapter 2-1 Conventional Encryption Message Confidentiality.

13. BETTER SYMMETRIC CIPHER STREAM CIPHERS 1. SOME TRICKS FOR SUBSTITUTION CIPHER There are some tricks to make substitution cipher safer: Nulls: insert.

Module 3 – Cryptography Cryptography basics Ciphers Symmetric Key Algorithms Public Key Algorithms Message Digests Digital Signatures.

Bit Cipher 1. Example of bit Cipher 2 Practical Stream Cipher 3.

Symmetric-Key Cryptography

Introduction to cryptography by konrad. Introduction to cryptography Cryptography is the process of encrypting/decrypting data streams using some E(M)/D(M)

Module :MA3036NI Cryptography and Number Theory Lecture Week 3 Symmetric Encryption-2.

9/03/15UB Fall 2015 CSE565: S. Upadhyaya Lec 2.1 CSE565: Computer Security Lecture 2 Basic Encryption & Decryption Shambhu Upadhyaya Computer Science &

CSCI 5857: Encoding and Encryption

Polyalphabetic CIPHERS Linguistics 484. Summary The idea How to recognize: index of coincidence How many alphabets: Kasiski.

Cryptography Lecture 2: Classic Ciphers Piotr Faliszewski.

1 University of Palestine Information Security Principles ITGD 2202 Ms. Eman Alajrami.

Cryptography Part 1: Classical Ciphers Jerzy Wojdyło May 4, 2001.

CRYPTANALYSIS OF STREAM CIPHER Bimal K Roy Cryptology Research Group Indian Statistical Institute Kolkata.

Traditional Symmetric-Key Ciphers

1 University of Palestine Information Security Principles ITGD 2202 Ms. Eman Alajrami 2 nd Semester

1 Codes, Ciphers, and Cryptography-Ch 2.2 Michael A. Karls Ball State University.

Introduction to Modern Symmetric-key Ciphers

Chapter 10 Hashing. The search time of each algorithm depend on the number n of elements of the collection S of the data. A searching technique called.

Section 2.2: Affine Ciphers; More Modular Arithmetic Shift ciphers use an additive key. To increase security, we can add a multiplicative parameter. –For.

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

Network Security Lecture 13 Presented by: Dr. Munam Ali Shah.

University of Malawi, Chancellor College

Chapter 7 – Confidentiality Using Symmetric Encryption.

Substitution Ciphers Reference –Matt Bishop, Computer Security, Addison Wesley, 2003.

Chapter Two: Classic Cryptography

Information and Network Security Lecture 2 Dr. Hadi AL Saadi.

CS480 Cryptography and Information Security Huiping Guo Department of Computer Science California State University, Los Angeles 4. Traditional and Modern.

3.1 Chapter 3 Traditional Symmetric-Key Ciphers Part2.

Introduction to Modern Symmetric-key Ciphers

Cryptanalysis of Vigenere Cipher

Presentation transcript:

Vigenere Cipher For example, choose a word “GOLD” for a key. And, add “GOLDGOLDGOLD….” to your plaintext Plaintext: t o o m u c h h y p e Key : GOLDGOLDGOLD _____+___________________ ZCZPAQSKEDP 1

Breaking the Vigenere Cipher Key: finding the length of the key. Kasiski Attack: For example, suppose “ZXY” occurs in the cyphertext at 17 th place, 137 th place, 217 th place, 265 th place, … Then, the length of the key may divide =120, =80, =48, … So, the length of the key| g.c.d.(120, 80, 48, …)=8 There are also statistical methods. 2

Strengthening Vigenere Cipher To strengthen a Vigenere cipher, you may use Latin squares for addition table. Latin square example A Latin square of order q is an qq array whose entries are taken from an alphabet of q symbols such that each symbol occurs exactly once in each row and column. A Latin square can be used to define a new “addition table.”

Stream Cipher We have learned one-time pad, Vigenere cipher, and so on. If we use a Latin square for the addition table, then it’s a little more general cipher, which is called “a stream cipher.”

Improving the key of the Vigenere cipher A simple improvement: encipher twice using two different keys k1 and k2. For example, encrypt a message once with the key FOXES and again with the key WOLVES Then, the actual key is FOXESFOXESFOXESFOXES… WOLVESWOLVESWOLVES…. +______________________ BCIZWXKLPNJGTSDASPAGQJBWOTZSIK

You see that the length of the key is l.c.d. (5, 6)=30. You can encrypt many times more with keys with different lengths. Re-encrypting with a word of length 7 (example: JAGUARS)-> the new key of period 210

FISH

It was a Vigenere cipher with keys of lengths 41, 31, 29, 26, 23, 43, 47, 51, 53,…. And the period of the keystring was their product (they are all prime to each other) Apparently the British intelligence service could break it. So, no cipher is truly safe.

Pseudorandom numbers What is “random”? According to Kolmogorov, A sequence is random if it cannot be generated by an algorithm with a description much shorter than the sequence itself. An alternative is to try to generate a sequence that has some desirable features of a random string. Which we call “pseudo-random”

One such way is “linear shift register” Example: 0010->0100->1001->… And put them all together …