Lecture 4.2: Hash Functions: Design*

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

description

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. Outline of Today’s lecture. Hash Functions Known Hash Functions SHA-1. - PowerPoint PPT Presentation

Transcript of Lecture 4.2: Hash Functions: Design*

Page 1: Lecture 4.2: Hash Functions: Design*

Lecture 4.2: Hash Functions: Design*

CS 436/636/736 Spring 2012

Nitesh Saxena * some slides borrowed from Gene Tsudik

Page 2: Lecture 4.2: Hash Functions: Design*

Course Administration

• HW1 being graded• HW2 posted–Due Tuesday, 11am – Feb 28

2

Page 3: Lecture 4.2: Hash Functions: Design*

Outline of Today’s lecture

• Hash Functions– Known Hash Functions• SHA-1

3

Page 4: Lecture 4.2: Hash Functions: Design*

4

Page 5: Lecture 4.2: Hash Functions: Design*

5

Page 6: Lecture 4.2: Hash Functions: Design*

6

Page 7: Lecture 4.2: Hash Functions: Design*

7

Page 8: Lecture 4.2: Hash Functions: Design*

8

Page 9: Lecture 4.2: Hash Functions: Design*

9

Page 10: Lecture 4.2: Hash Functions: Design*

10

Page 11: Lecture 4.2: Hash Functions: Design*

11

Page 12: Lecture 4.2: Hash Functions: Design*

12

Page 13: Lecture 4.2: Hash Functions: Design*

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

Page 14: Lecture 4.2: Hash Functions: Design*

Current Security of MD5 and SHA-1• SHA-1

– B’day attack requires 280 calls– Faster attacks 269 calls http://infosec.sdu6.edu.cn/uploadfile/papers/Finding%20Collisions%20in%20the%20Full%20SHA-1.pdf

• MD5 – Output is 128-bits, so B’day attack requires 264 calls only– Faster attacks to find a collision: http://eprint.iacr.org/2004/199.pdf

• Better use stronger versions, such as SHA-256• Although, these attacks are still not practical – they only find

two random messages that collide14

http://infosec.sdu6.edu.cn/uploadfile/papers/Finding%20Collisions%20in%20the%20Full%20SHA-1.pdf
http://infosec.sdu6.edu.cn/uploadfile/papers/Finding%20Collisions%20in%20the%20Full%20SHA-1.pdf
http://eprint.iacr.org/2004/199.pdf
Page 15: Lecture 4.2: Hash Functions: Design*

Further Reading

• Stallings Chapter 11• HAC Chapter 9

15


AADS_14_Hash Tables & Hash Functions

AADS_14_Hash Tables & Hash Functions

Cryptographic Hash Funcitonsjain/cse571-17/ftp/l_11chf.pdf · Cryptographic Hash Functions 2. Applications of Crypto Hash Functions 3. Birthday Problem 4. Secure Hash Algorithm (SHA)

Cryptographic Hash Funcitonsjain/cse571-17/ftp/l_11chf.pdf · Cryptographic Hash Functions 2. Applications of Crypto Hash Functions 3. Birthday Problem 4. Secure Hash Algorithm (SHA)

Hash Functions Ver2

Hash Functions Ver2

Message Authentication Codes and Cryptographic Hash ...Building MACs from Hash Functions • HMAC is a MAC from hash functions. – Hash-based message authentication code • Let h

Message Authentication Codes and Cryptographic Hash ...Building MACs from Hash Functions • HMAC is a MAC from hash functions. – Hash-based message authentication code • Let h

1 Hash Function. Hash Functions Dedicated Hash Functions ◦ Useful for lightweight authentication in RFID system Message Authentication Codes ◦ CBC-MAC.

1 Hash Function. Hash Functions Dedicated Hash Functions ◦ Useful for lightweight authentication in RFID system Message Authentication Codes ◦ CBC-MAC.

1 Chapter 4 Cryptographic Hash Functions. 2 Outline 4.1 Hash Functions and Data Integrity 4.2 Security of Hash Functions 4.3 Iterated Hash Functions 4.4.

1 Chapter 4 Cryptographic Hash Functions. 2 Outline 4.1 Hash Functions and Data Integrity 4.2 Security of Hash Functions 4.3 Iterated Hash Functions 4.4.

Cryptographic hash functions - University Of Maryland · Applications of hash functions •Virus fingerprinting •Deduplication •Password hashing ... •Uses hash function to index

Cryptographic hash functions - University Of Maryland · Applications of hash functions •Virus fingerprinting •Deduplication •Password hashing ... •Uses hash function to index

ryptographic Hash Functions

ryptographic Hash Functions

Secure Hash Functions

Secure Hash Functions

Dual universality of hash functions and its applications to ...hash functions, as a generalization of the conventional universal2 hash functions. Then we show that this generalized

Dual universality of hash functions and its applications to ...hash functions, as a generalization of the conventional universal2 hash functions. Then we show that this generalized

On hash functions using checksums€¦ · Keywords: Iterated hash functions, checksums, multicollisions, second preimage and herding attack. 1 Introduction Cryptographic hash functions

On hash functions using checksums€¦ · Keywords: Iterated hash functions, checksums, multicollisions, second preimage and herding attack. 1 Introduction Cryptographic hash functions

Hash Functions Introduction

Hash Functions Introduction

Cryptographic Hash Functions - Shai Halevi · Using “imperfect ” hash functions Applications should rely only on “specific security properties ” of hash functions – Try

Cryptographic Hash Functions - Shai Halevi · Using “imperfect ” hash functions Applications should rely only on “specific security properties ” of hash functions – Try

Non-Malleable Hash Functions

Non-Malleable Hash Functions

Cryptographic Hash functions Hash Functions RIPEMD-160 and

Cryptographic Hash functions Hash Functions RIPEMD-160 and

Chapter 3: [1.5ex] Similarity Preserving Hash Functions · Similarity Preserving Hash Functions Frank Breitinger ... I Similarity digests ... Frank Breitinger Hash Functions in Forensics

Chapter 3: [1.5ex] Similarity Preserving Hash Functions · Similarity Preserving Hash Functions Frank Breitinger ... I Similarity digests ... Frank Breitinger Hash Functions in Forensics

Hash Functions Nathanael Paul Oct. 9, 2002. Hash Functions: Introduction Cryptographic hash functions –Input – any length –Output – fixed length –H(x)

Hash Functions Nathanael Paul Oct. 9, 2002. Hash Functions: Introduction Cryptographic hash functions –Input – any length –Output – fixed length –H(x)

L11 - Cryptographic Hash Functions

L11 - Cryptographic Hash Functions

Cryptographic Hash Functions Message Authentication ...web.cse.ohio-state.edu/~lai.1/651/6.hash-MAC.pdf · Cryptographic Hash Functions Message Authentication Digital Signatures.

Cryptographic Hash Functions Message Authentication ...web.cse.ohio-state.edu/~lai.1/651/6.hash-MAC.pdf · Cryptographic Hash Functions Message Authentication Digital Signatures.

Chapter 5 Hash Functions

Chapter 5 Hash Functions