Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed...
-
Upload
dominic-harrington -
Category
Documents
-
view
213 -
download
0
Transcript of Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed...
![Page 1: Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik.](https://reader036.fdocuments.us/reader036/viewer/2022062722/56649f355503460f94c532d3/html5/thumbnails/1.jpg)
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* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik.](https://reader036.fdocuments.us/reader036/viewer/2022062722/56649f355503460f94c532d3/html5/thumbnails/2.jpg)
Course Administration
• HW1 being graded• HW2 posted–Due Tuesday, 11am – Feb 28
2
![Page 3: Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik.](https://reader036.fdocuments.us/reader036/viewer/2022062722/56649f355503460f94c532d3/html5/thumbnails/3.jpg)
Outline of Today’s lecture
• Hash Functions– Known Hash Functions• SHA-1
3
![Page 4: Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik.](https://reader036.fdocuments.us/reader036/viewer/2022062722/56649f355503460f94c532d3/html5/thumbnails/4.jpg)
4
![Page 5: Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik.](https://reader036.fdocuments.us/reader036/viewer/2022062722/56649f355503460f94c532d3/html5/thumbnails/5.jpg)
5
![Page 6: Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik.](https://reader036.fdocuments.us/reader036/viewer/2022062722/56649f355503460f94c532d3/html5/thumbnails/6.jpg)
6
![Page 7: Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik.](https://reader036.fdocuments.us/reader036/viewer/2022062722/56649f355503460f94c532d3/html5/thumbnails/7.jpg)
7
![Page 8: Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik.](https://reader036.fdocuments.us/reader036/viewer/2022062722/56649f355503460f94c532d3/html5/thumbnails/8.jpg)
8
![Page 9: Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik.](https://reader036.fdocuments.us/reader036/viewer/2022062722/56649f355503460f94c532d3/html5/thumbnails/9.jpg)
9
![Page 10: Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik.](https://reader036.fdocuments.us/reader036/viewer/2022062722/56649f355503460f94c532d3/html5/thumbnails/10.jpg)
10
![Page 11: Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik.](https://reader036.fdocuments.us/reader036/viewer/2022062722/56649f355503460f94c532d3/html5/thumbnails/11.jpg)
11
![Page 12: Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik.](https://reader036.fdocuments.us/reader036/viewer/2022062722/56649f355503460f94c532d3/html5/thumbnails/12.jpg)
12
![Page 13: Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik.](https://reader036.fdocuments.us/reader036/viewer/2022062722/56649f355503460f94c532d3/html5/thumbnails/13.jpg)
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* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik.](https://reader036.fdocuments.us/reader036/viewer/2022062722/56649f355503460f94c532d3/html5/thumbnails/14.jpg)
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
![Page 15: Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik.](https://reader036.fdocuments.us/reader036/viewer/2022062722/56649f355503460f94c532d3/html5/thumbnails/15.jpg)
Further Reading
• Stallings Chapter 11• HAC Chapter 9
15