Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik.

Slides:

Advertisements

Similar presentations

Lecture 7.1: Privacy and Anonymity Using Anonymizing Networks - I CS 436/636/736 Spring 2012 Nitesh Saxena Some slides borrowed from Philippe Golle, Markus.

Advertisements

Lecture 3.3: Public Key Cryptography III CS 436/636/736 Spring 2012 Nitesh Saxena.

HASH ALGORITHMS - Chapter 12

Announcements: 1. HW7 due next Tuesday. 2. Inauguration today! Questions? This week: Discrete Logs, Diffie-Hellman, ElGamal Discrete Logs, Diffie-Hellman,

Announcements: 1. Class cancelled tomorrow 2. HW7 due date moved to Thursday. Questions? This week: Birthday attacks, Digital signatures Birthday attacks,

SHA (secure hash algorithm) Jen-Chang Liu, 2005 Adapted from lecture slides by Lawrie Brown.

Announcements: 1. HW6 due now 2. HW7 posted Questions? This week: Discrete Logs, Diffie-Hellman, ElGamal Discrete Logs, Diffie-Hellman, ElGamal Hash Functions.

Secure Hashing and DSS Sultan Almuhammadi ICS 454 Principles of Cryptography.

Module 4 Hash Functions Highline Community College Seattle University University of Washington in conjunction with the National Science Foundation.

Cryptography and Network Security Chapter 12 Fourth Edition by William Stallings Lecture slides by Lawrie Brown.

Lecture 3.2: Public Key Cryptography II CS 436/636/736 Spring 2012 Nitesh Saxena.

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

Hashing (Message Digest) Hello There.

Dan Boneh Collision resistance Generic birthday attack Online Cryptography Course Dan Boneh.

Lecture 9: Security via PGP CS 436/636/736 Spring 2012 Nitesh Saxena.

Cryptography and Network Security Chapter 11 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.

Lecture 3.2: Public Key Cryptography II CS 436/636/736 Spring 2014 Nitesh Saxena.

CMSC 414 Computer and Network Security Lecture 6 Jonathan Katz.

Lecture 3.4: Public Key Cryptography IV CS 436/636/736 Spring 2013 Nitesh Saxena.

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

1 Hashes and Message Digests. 2 Hash Also known as –Message digest –One-way function Function: input message -> output One-way: d=h(m), but not h’(d)

Lecture 3.4: Recursive Algorithms CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Zeph Grunschlag.

Lecture 8 Overview. Secure Hash Algorithm (SHA) SHA SHA SHA – SHA-224, SHA-256, SHA-384, SHA-512 SHA-1 A message composed of b bits.

Lecture 6.2: Protocols - Authentication and Key Exchange II CS 436/636/736 Spring 2012 Nitesh Saxena.

Lecture 5.2: Key Distribution: Private Key Setting CS 436/636/736 Spring 2012 Nitesh Saxena.

Week 4 - Friday.  What did we talk about last time?  Snow day  But you should have read about  Key management.

Lecture 6.1: Protocols - Authentication and Key Exchange I CS 436/636/736 Spring 2012 Nitesh Saxena.

Lecture 4.3: Closures and Equivalence Relations CS 250, Discrete Structures, Fall 2013 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.

Lecture 5.1: Message Authentication Codes, and Key Distribution

1 Chapter 12: Hash and MAC Algorithms Fourth Edition by William Stallings Lecture slides by Lawrie Brown (modified by Prof. M. Singhal, U of Kentucky)

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

CS426Fall 2010/Lecture 51 Computer Security CS 426 Lecture 5 Cryptography: Cryptographic Hash Function.

Lecture 3.1: Public Key Cryptography I CS 436/636/736 Spring 2012 Nitesh Saxena.

Lecture 3.1: Public Key Cryptography I CS 436/636/736 Spring 2015 Nitesh Saxena.

Hashes Lesson Introduction ●The birthday paradox and length of hash ●Secure hash function ●HMAC.

IT 221: Introduction to Information Security Principles Lecture 5: Message Authentications, Hash Functions and Hash/Mac Algorithms For Educational Purposes.

Lecture 1.5: Proof Techniques CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda Heeren 1.

Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.

9/29/2011Lecture Strong Induction1 Lecture 3.2: Strong Induction CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures.

Secure Instant Messenger in Android Name: Shamik Roy Chowdhury.

Lecture 1.5: Proof Techniques

If the hash algorithm is properly designed and distributes the hashes uniformly over the output space, "finding a hash collision" by random guessing is.

DTTF/NB479: Dszquphsbqiz Day 26

Lecture 3.2: Public Key Cryptography II

Lecture 1.5: Proof Techniques

Some slides borrowed from Philippe Golle, Markus Jacobson

Lecture 2.2: Private Key Cryptography II

Cryptographic Hash Functions

CS 336/536: Computer Network Security Fall 2015 Nitesh Saxena

Lecture 3.1: Public Key Cryptography I

DTTF/NB479: Dszquphsbqiz Day 27

Lecture 1.6: Proof Techniques (contd)

Lecture 4.1: Hash Functions: Introduction

Lecture 10: Usable Security

CS 336/536: Computer Network Security Fall 2014 Nitesh Saxena

CS 250, Discrete Structures, Fall 2014 Nitesh Saxena

Lecture 1.6: Proof Techniques (contd)

Lecture 4.1: Hash Functions, and Message Authentication Codes

CS 250, Discrete Structures, Fall 2014 Nitesh Saxena

SHA: Secure Hash Algorithm

CS 336/536: Computer Network Security Fall 2014 Nitesh Saxena

Lecture 4: Hash Functions

CS 336/536: Computer Network Security Fall 2015 Nitesh Saxena

CS 250, Discrete Structures, Fall 2015 Nitesh Saxena

The Secure Hash Function (SHA)

CS 250, Discrete Structures, Fall 2015 Nitesh Saxena

Cryptographic Hash Functions

Lecture 6.2: Protocols - Authentication and Key Exchange II

Presentation transcript:

Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik

Course Administration HW1 being graded HW2 posted – Due Tuesday, 11am – Feb 28 2

Outline of Today’s lecture Hash Functions – Known Hash Functions SHA-1 3

4

5

6

7

8

9

10

11

12

Other Hash Functions Many other hash functions – SHA-2 (SHA-256) Output 256 bits – MD5 – Message Digest algorithm 5 Output 128 bits Very similar to SHA – please study on your own – MD4 – MD6 –.. 13

Current Security of MD5 and SHA-1 SHA-1 – B’day attack requires 2 80 calls – Faster attacks 2 69 calls %20the%20Full%20SHA-1.pdf MD5 – Output is 128-bits, so B’day attack requires 2 64 calls only – Faster attacks to find a collision: Better use stronger versions, such as SHA-256 Although, these attacks are still not practical – they only find two random messages that collide 14

Further Reading Stallings Chapter 11 HAC Chapter 9 15