Rennes, 27/11/2014 Cristina Onete Subject Review, Questions, and Exam Practice.

Slides:

Advertisements

Similar presentations

Rennes, 23/10/2014 Cristina Onete Commitment Schemes and Identification/Authentication.

Advertisements

Dan Boneh Using block ciphers Modes of operation: one time key Online Cryptography Course Dan Boneh example: encrypted , new key for every message.

“Advanced Encryption Standard” & “Modes of Operation”

Rennes, 23/10/2014 Cristina Onete Commitment Schemes and Identification/Authentication.

1 PRPs and PRFs CS255: Winter Abstract ciphers: PRPs and PRFs, 2.Security models for encryption, 3.Analysis of CBC and counter mode Dan Boneh, Stanford.

Rennes, 23/10/2014 Cristina Onete Key-Exchange Protocols. Diffie-Hellman, Active Attacks, and TLS/SSL.

1 Brief PRP-PRF Recap CS255 Winter ‘06. 2 PRPs and PRFs PRF: F: K  X  Y such that: exists “efficient” algorithm to eval. F(k,x) PRP: E: K  X  X such.

1 CIS 5371 Cryptography 4. Collision Resistant Hash Functions B ased on: Jonathan Katz and Yehuda Lindell Introduction to Modern Cryptography.

Rennes, 23/10/2014 Cristina Onete Putting it all together: using multiple primitives together.

Block Ciphers 1 Block Ciphers Block Ciphers 2 Block Ciphers  Modern version of a codebook cipher  In effect, a block cipher algorithm yields a huge.

CMSC 456 Introduction to Cryptography

CMSC 414 Computer and Network Security Lecture 4 Jonathan Katz.

Foundations of Network and Computer Security J J ohn Black Lecture #8 Sep 15 th 2005 CSCI 6268/TLEN 5831, Fall 2005.

CMSC 414 Computer and Network Security Lecture 4 Jonathan Katz.

CS470, A.SelcukHash Functions1 Cryptographic Hash Functions CS 470 Introduction to Applied Cryptography Instructor: Ali Aydin Selcuk.

Lecture 23 Symmetric Encryption

Feb 19, 2002Mårten Trolin1 Previous lecture Practical things about the course. Example of cryptosystem — substitution cipher. Symmetric vs. asymmetric.

Rennes, 15/10/2014 Cristina Onete Message authenticity: Digital Signatures.

HASH Functions.

Hash Functions A hash function H accepts a variable-length block of data M as input and produces a fixed-size hash value h = H(M) Principal object is.

Hardness Assumptions Related to Ad-Hoc Constructions Shai Halevi February 22, 2007.

CS 4/585: Cryptography Tom Shrimpton FAB

Rennes, 23/10/2014 Cristina Onete Graded Exercises & Authentication.

Towards Automated Security Proof for Symmetric Encryption Modes Martin Gagné Joint work with Reihaneh Safavi-Naini, Pascal Lafourcade and Yassine Lakhnech.

Lecture 4.1: Hash Functions, and Message Authentication Codes CS 436/636/736 Spring 2015 Nitesh Saxena.

Cryptography and Network Security

CS555Spring 2012/Topic 111 Cryptography CS 555 Topic 11: Encryption Modes and CCA Security.

Dan Boneh Using block ciphers Modes of operation: many time key (CTR) Online Cryptography Course Dan Boneh Example applications: 1. File systems: Same.

AVALANCHE EFFECT IN THE FAMILY OF BLOCK CIPHERS “SD-(n,k)” University “Ss Cyril and Methodius” – Skopje, RM S. Markovski, PhD A. Mileva, MSc D. Gligoroski,

CMSC 414 Computer and Network Security Lecture 5 Jonathan Katz.

Feb 17, 2003Mårten Trolin1 Previous lecture Practical things about the course. Example of cryptosystem — substitution cipher. Symmetric vs. asymmetric.

1.1 Chapter 8 Encipherment Using Modern Symmetric-Key Ciphers Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

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

1 Symmetric-Key Encryption CSE 5351: Introduction to Cryptography Reading assignment: Chapter 3 Read sections first (skipping 3.2.2)

Rennes, 02/10/2014 Cristina Onete Attacks on RSA. Safe modes.

Chapter 11 Message Authentication and Hash Functions.

Lecture 5 Block Diagrams Modes of Operation of Block Ciphers.

Exam 1 Review CS461/ECE422 Fall Exam guidelines A single page of supplementary notes is allowed  8.5x11. Both sides. Write as small as you like.

Ln Lou Modern Cyphers. 0. Security System Key Plain Text Cipher Text Encryption (K × P → C) Decryption (K × C → P)

Cryptographic Hash Functions Prepared by Dr. Lamiaa Elshenawy

Class 3 Cryptography Refresher II CIS 755: Advanced Computer Security Spring 2015 Eugene Vasserman

Cryptography and Network Security (CS435) Part Nine (Message Authentication)

Lecture 5.1: Message Authentication Codes, and Key Distribution

Lecture 4.1: Hash Functions, and Message Authentication Codes CS 436/636/736 Spring 2014 Nitesh Saxena.

Cryptographic Hash Functions

Network Security. Three tools Hash Function Block Cipher Public Key / Private Key.

Cryptography and Network Security

Homework #2 J. H. Wang Oct. 31, 2012.

Part 1  Cryptography 1 Integrity Part 1  Cryptography 2 Data Integrity  Integrity  detect unauthorized writing (i.e., modification of data)  Example:

Understanding Cryptography by Christof Paar and Jan Pelzl These slides were prepared by Christof Paar and Jan Pelzl Chapter 12.

CSCE 715: Network Systems Security

رمزنگاري متقارن بهروز ترك‏لاداني 1.

Cryptography Lecture 13.

MAC: Message Authentication Code

Block cipher and modes of encryptions

Foundations of Network and Computer Security

CSE 484 Midterm Review “1st half of the quarter in 5 slides”

Security Of Wireless Sensor Networks

Symmetric-Key Encryption

Block vs Stream Ciphers

Foundations of Network and Computer Security

Block Ciphers (Crypto 2)

Security of Wireless Sensor Networks

Cryptography Lecture 12.

Lecture 4.1: Hash Functions, and Message Authentication Codes

Cryptography Lecture 14.

Cryptography Lecture 13.

Cryptography Lecture 13.

Counter Mode, Output Feedback Mode

Elect. Codebook, Cipher Block Chaining

Presentation transcript:

Rennes, 27/11/2014 Cristina Onete Subject Review, Questions, and Exam Practice

 Review : Feistel schemes  Some properties: Exercise 3: Show that 1 round is insecure Cristina Onete || 27/11/2014 || 2 Exercise 4: Show that 2 rounds are insecure Exercise 5: Show that 3 rounds are insecure under IND-CCA Exercise 1: What is the rele- vant security notion? Exercise 2: What is the connec- tion between security and PRPs?  Structure used in block cipher construction

 Cristina Onete || 27/11/2014 || 3 PRPs  Exercise 6: Explain what is meant by the information in the red box

 Cristina Onete || 27/11/2014 || 4 Modes of operation  Exercise 7: Describe the following modes of operation for block ciphers:  ECB  CBC  CTR  Exercise 8: Which modes are deterministic? In which conditions? (think of the IVs)  Exercise 9: Can you find an attack for the ECB mode?

 Cristina Onete || 27/11/2014 || 5 Birthday Paradox  Exercise 10: Explain the result in Experiment 2

 Cristina Onete || 27/11/2014 || 6 Birthday attack vs paradox  Exercise 11: How can we use the birthday paradox in an attack?

 Cristina Onete || 27/11/2014 || 7 Hash functions  Exercise 12: What is the difference between hash functions in general and cryptographic hash functions?  Exercise 13: There are always collisions in hash functions. When do we call a cryptographic hash function secure? Why do we call them secure if such collisions exist?  Exercise 14: Can you give an example of where a stream cipher is used in practical protocols?

CIDRE Thanks!