Diffusion and Confusion Two properties that a good cryptosystem should have: Diffusion: change of one character in the plaintext results in several characters.

Slides:

Advertisements

Similar presentations

Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesThe Mighty Mod.

Advertisements

390 Codes, Ciphers, and Cryptography

CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (3) Information Security.

IS 302: Information Security and Trust Week 4: Asymmetric Encryption

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.

1 CIS 5371 Cryptography 5b. Pseudorandom Objects in Practice Block Ciphers.

Making “Good” Encryption Algorithms

Cryptology Terminology and Early History. Cryptology Terms Cryptology –The science of concealing the meaning of messages and the discovery of the meaning.

Cryptography and Network Security Chapter 3

Week 2 - Friday.  What did we talk about last time?  Substitution ciphers  Vigenère ciphers  One-time pad.

Announcements: We’ll attempt to grade Friday’s quizzes by end of day on Friday and leave outside my office We’ll attempt to grade Friday’s quizzes by end.

Advanced Encryption Standard

SYMMETRIC CRYPTOSYSTEMS Symmetric Cryptosystems 10/06/2015 | pag. 2.

Classical Cryptography 1. Introduction: Some Simple Cryptosystems.

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.

Announcements: Assignment 2 finalized Assignment 2 finalizedQuestions?Today: Wrap up Hill ciphers Wrap up Hill ciphers One-time pads and LFSR One-time.

Announcements: Pass in Assignment 1 now Pass in Assignment 1 now Meet my assistant Kevin Reed Meet my assistant Kevin Reed Assignment 2 (tentative) posted.

Cryptanalysis of the Playfair Cipher Using an Evolutionary Algorithm By: Benjamin Rhew.

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

EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 5 Wenbing Zhao Department of Electrical and Computer Engineering.

Chapter 2 Basic Encryption and Decryption (part B)

Introduction to Computer and Network Security Iliano Cervesato 26 August 2008 – Modern Cryptography.

8: Network Security8-1 Symmetric key cryptography symmetric key crypto: Bob and Alice share know same (symmetric) key: K r e.g., key is knowing substitution.

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

Chapter 13: Electronic Commerce and Information Security Invitation to Computer Science, C++ Version, Fourth Edition SP09: Contains security section (13.4)

Section 2.9 The Hill Cipher; Matrices

An Introduction to Hill Ciphers Using Linear Algebra Brian Worthington University of North Texas MATH /10/2010.

L1.1. An Introduction to Classical Cryptosystems Rocky K. C. Chang, February 2013.

CSE 651: Introduction to Network Security

ECE454/CS594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2011.

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.

Chapter 12 Cryptography (slides edited by Erin Chambers)

Cryptography Week-6.

Cryptanalysis of Modern Symmetric-Key Block Ciphers [Based on “A Tutorial on Linear and Differential Cryptanalysis” by Howard Heys.] Modern block ciphers.

CSCI 5857: Encoding and Encryption

symmetric key cryptography

Confusion and Diffusion1 Ref: William Stallings, Cryptography and Network Security, 3rd Edition, Prentice Hall, 2003.

Systems of Equations as Matrices and Hill Cipher.

Lec. 5 : History of Cryptologic Research II

1 Secure Hill Cipher Modification SHC-M A.G.Chefranov Eastern Mediterranean University, North Cyprus, Taganrog Institute of Technology, Federal University.

Midterm Review Cryptography & Network Security

Symmetric-Key Cryptography

Part 9, Basic Cryptography 1. Introduction A cryptosystem is a tuple: ( M,K,C, E,D) where M is the set of plaintexts K the set of keys C the set of ciphertexts.

Introduction to Ciphers Breno de Medeiros. Cipher types From “Cipher”, Wikipedia article.

Some Number Theory Modulo Operation: Question: What is 12 mod 9?

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

Lecture 3 Page 1 Advanced Network Security Review of Cryptography Advanced Network Security Peter Reiher August, 2014.

Part 9, Basic Cryptography 1. Introduction A cryptosystem is a tuple: ( M,K,C, E,D) where M is the set of plaintexts K the set of keys C the set of ciphertexts.

8.6. Knapsack Ciphers. The Concept At the core of the Knapsack cipher is the Knapsack problem: At the core of the Knapsack cipher is the Knapsack problem:

Traditional Symmetric-Key Ciphers

Announcements: Matlab tutorial linked to in syllabus Matlab tutorial linked to in syllabusQuestions?Today: Block ciphers, especially Hill Ciphers Modular.

Le Trong Ngoc Security Fundamentals (2) Encryption mechanisms 4/2011.

24-Nov-15Security Cryptography Cryptography is the science and art of transforming messages to make them secure and immune to attacks. It involves plaintext,

Lecture 23 Symmetric Encryption

1 Symmetric key cryptography: DES DES: Data Encryption Standard US encryption standard [NIST 1993] 56-bit symmetric key, 64 bit plaintext input How secure.

Section 2.3: Substitution Ciphers

Symmetric Cipher Model Plaintext input 1- encryption algorithm 2- secret key Encryption Cipher text output Cipher text input 1- Decryption algorithm 2-

CST 312 Pablo Breuer. A block of plaintext is treated as a whole and used to produce a ciphertext block of equal length Typically a block size of 64 or.

@Yuan Xue CS 285 Network Security Cryptography Overview and Classical Encryption Algorithms Fall 2012 Yuan Xue.

3.1 Chapter 3 Traditional Symmetric-Key Ciphers Part2.

@Yuan Xue Quick Review.

CRYPTOGRAPHY G REEK WORD MEANING “ SECRET WRITING ”

Columnar Transposition

Classical Polygraphic Ciphers

Computer and Data Security 4th Class

Campbell R. Harvey Duke University and NBER

AES Objectives ❏ To review a short history of AES

Hill Cipher The Hill Cipher uses matrix multiplication to encrypt a message. First, you need to assign two numbers to each letter in the alphabet and also.

Florida State University

Presentation transcript:

Diffusion and Confusion Two properties that a good cryptosystem should have: Diffusion: change of one character in the plaintext results in several characters changed in the ciphertext Confusion: the key does not relate in a simple way to the ciphertext (in particular, each character of ciphertext should depend on several parts of the key) What about the cryptosystems we’ve seen so far ?

Block Ciphers - blocks of letters encrypted simultaneously - in general, have the diffusion and confusion properties Simple examples: The Playfair cipher (used in WWI by the British): - encrypts digrams by digrams (for details see Section 2.6) The ADFGX cipher (used in WWI by the Germans): - encrypts letters by digrams, followed by permuting the encrypted letters within each block (for details see Section 2.6) The Hill cipher: see next slide (Section 2.7) Remark: Many modern cryptosystems (DES, AES, RSA) are also block ciphers.

Hill Cipher Key:an invertible m x m matrix (where m is the block length) [defines a linear transformation] Encryption: - view a block of m letters as a vector, multiply by the key Example: key K = What is m ? How to encrypt blah ?

Hill Cipher Decrypting: - multiply each block by K -1 How to invert a matrix K ? - invertible (mod 26) iff gcd(det(K),26)=1 - if m=2 and invertible, then: K -1 = det(K) -1 - inverting matrices for other values of m: see any basic linear algebra text k 2,2 -k 1,2 -k 2,1 k 1,1

Hill Cipher Decrypting: - multiply each block by K -1 How to invert a matrix K ? - invertible (mod 26) iff gcd(det(K),26)=1 - if m=2 and invertible, then: K -1 = det(K) -1 - inverting matrices for other values of m: see any basic linear algebra text k 2,2 -k 1,2 -k 2,1 k 1,1

Hill Cipher Remark: The Hill cipher is a generalization of the permutation cipher (permute the letters within each block) Cryptanalysis: - hard with ciphertext-only - easy with known plaintext: - suppose we know m: - how to find m ?