1 Week 7 Heuristic Searches Intro to Cryptography Slides courtesy of Professor Sheridan Houghten.

Slides:

Advertisements

Similar presentations

6.1.2 Overview DES is a block cipher, as shown in Figure 6.1.

Advertisements

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

Data Security 1 El_Gamal Cryptography. Data Security2 Introduction El_Gamal is a public-key cryptosystem technique El_Gamal is a public-key cryptosystem.

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

COSC 4P03 Week 91 Public Key Cryptography Slides courtesy of Professor Sheridan Houghten.

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

Digital Kommunikationselektroink TNE027 Lecture 6 (Cryptography) 1 Cryptography Algorithms Symmetric and Asymmetric Cryptography Algorithms Data Stream.

Intro 1 Introduction Intro 2 Good Guys and Bad Guys  Alice and Bob are the good guys  Trudy is the bad guy  Trudy is our generic “intruder”

Public Key Encryption Algorithm

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

Classical Cryptography 1. Introduction: Some Simple Cryptosystems.

Cryptography Cryptography: art or science of keeping messages secret Cryptology: branch of mathematics that studies the mathematical foundations of cryptographic.

Practical Techniques for Searches on Encrypted Data Author: Dawn Xiaodong Song, David Wagner, Adrian Perrig Presenter: 紀銘偉.

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

ICS 454: Principles of Cryptography

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

CYPHER INDEX n Introduction n Background n Demo INTRODUCTION n Cypher is a software toolkit designed to aid in the decryption of standard (historical)

Lecture 2.2: Private Key Cryptography II CS 436/636/736 Spring 2012 Nitesh Saxena.

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

CPSC CPSC 3730 Cryptography Chapter 2 Classical Encryption Techniques.

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

Cryptography Introduction, continued. Sufficient key space principle If an encryption scheme has a key space that is too small, then it will be vulnerable.

Computer Security CS 426 Lecture 3

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

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

Polyalphabetic Substitution Ciphers. First Steps Towards Complexity  If one alphabet is good, then two alphabets must be better!  By doubling the number.

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

MAT 1000 Mathematics in Today's World Winter 2015.

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

Cryptography Data communications and networks Momina Tariq: Ambreen Sohail: Data Communications and Networks.

Day 18. Concepts Plaintext: the original message Ciphertext: the transformed message Encryption: transformation of plaintext into ciphertext Decryption:

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

Symmetric-Key Cryptography

Classical Encryption techniques

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

Cryptograpy By Roya Furmuly W C I H D F O P S L 7.

1 Cryptanalysis Four kinds of attacks (recall) The objective: determine the key ( Herckhoff principle ) Assumption: English plaintext text Basic techniques:

BLOCK CIPHER SYSTEMS OPERATION MODES OF DATA ENCRYPTION STANDARD (DES)

McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Security.

Traditional Symmetric-Key Ciphers

Introduction to Modern Symmetric-key Ciphers

Tractability & Cryptography Strange Symbiosis Points of Reference: Oskars Rieksts.

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.

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

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

MAT 1000 Mathematics in Today's World Winter 2015.

Section 2.3: Substitution Ciphers

Introduction to Cryptography Lecture 8. Polyalphabetic Substitutions Definition: Let be different substitution ciphers. Then to encrypt the message apply.

Cellular Encryption CREU Project Team: Alburn Brown Orkun Kaya Isaac Rieksts Eric Thorpe.

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

Vigenère Tableau Reference –Matt Bishop, Computer Security, Addison Wesley, 2003.

1 Week 5 Courtesy of Sheridan Houghten. 2 Lexicographic Order – Subsets of {1, …, n} (See KS, algorithm 2.1) Algorithm to find rank of subset T: FindRank(n,

Vigenére Cipher Kimberly Chiffens & Maria Jannelli.

University of Malawi, Chancellor College

1 Introduction CS 303 Algorithmic Number Theory and Cryptography Jeremy R. Johnson.

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

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

Substitution Ciphers.

Lecture 2.2: Private Key Cryptography II

PART VII Security.

ICS 454: Principles of Cryptography

Introduction to Modern Symmetric-key Ciphers

Classical Polyalphabetic Ciphers

ADVANCED ENCRYPTION STANDARDADVANCED ENCRYPTION STANDARD

Cryptanalysis of Vigenere Cipher

Homework #1 Chap. 1, 3, 4 J. H. Wang Oct. 2, 2018.

Introduction to Cryptography I

Symmetric Encryption or conventional / private-key / single-key

ICS 555: Block Ciphers & DES Sultan Almuhammadi.

Presentation transcript:

1 Week 7 Heuristic Searches Intro to Cryptography Slides courtesy of Professor Sheridan Houghten

2 Generic Heuristic Search – see section 5.1, KS c = 0; select a feasible solution X; X best = X; while(c <= c max ) // c counts the number of iterations { Y = h N (X); //using chosen search strategy if(Y != fail) { X = Y; if(P(X) > P(X best )) X best = X; } c++; } return X best ;

3 Uniform Graph Partition (UGP) Example (see section 5.1.1, KS) uv[Y0,Y1]GainCost , , , , , , X 0 = 0257, X 1 = 1346 Cost: = 21

4 Uniform Graph Partition – UGP Algorithm to find initial solution: SelectPartition() { r = random(0, (2n choose n) – 1); X0 = KSubsetLexUnrank(r, n, 2n); //note change from book X1 = V – X0; }

5 UGP Neighbourhood Search Ascend([X0, X1]) { g = 0;// gain for each i in X0 { for each j in X1 {t = gain([X0, X1], i, j); if(t > g)// current best { x = i; y = j; g = t; } if g > 0// improved { Y0 = (X0 U {y}) – {x}; Y1 = (X1 U {x}) – {y}; fail = false; return ([Y0, Y1]); } else// no improvement { fail = true; return ([X0, X1]); }

6 Hill Climbing for UGP UGP(cmax) { [X0, X1] = SelectPartition(); for(c = 0; c < cmax; c++) { [Y0, Y1] = Ascend([X0, X1]); if(!fail) // use new partition and try again { X0 = Y0; X1 = Y1; } else return; // couldn’t improve }

7 Simulated Annealing (UGP) T = T0; Select feasible solution X; X best = X; for(c = 0; c < cmax; c++, T *= a) { Y = h N (X); // random feas. soln from neigh. search // UGP: find random values of i and j to swap if(Y != fail) { if(P(Y) >= P(X))// improved: always keep it { X = Y; if(P(X) > P(X best ) X best = X; } else // not improved: may keep it { r = random(0,1); if(r < exp((P(Y) – P(X))/T) X = Y; } return X best ;

8 Shift Cipher Example K = 11, Plaintext:“meetatmidnight” Translation: Encryption: Corresponding ciphertext: “XPPELEXTOYTRSE” Translation: Decryption: Corresponding plaintext: “meetatmidnight”

9 Substitution Cipher Example Possible permutation for encryption: Corresponding permutation for decryption: Plaintext: meetatnoon Ciphertext: THHMXMSFFS

10 Vigenere Cipher Example Keyword: BROCK → key = (1,17,14,2,10) Plaintext:“meetatmidnight” Translation: Encryption: Corresponding ciphertext: “NVSVKUDWFXJXVV” Translation: Decryption: Corresponding plaintext: “meetatmidnight”

11 Stream Cipher Example Linear Feedback Register Let m = 4 and z i+4 = (z i + z i+1 ) mod 2