Seminar Hashfunctions
Corresponding entry in Aachen Campus, Bonn Computer Science, Bonn Mathematics, Bonn University.
Lecture
Prof. Dr. Joachim von zur Gathen, Daniel Loebenberger
Time & Place
- Monday, 1600-1730, b-it 2.1 (seminar room).
First meeting: 7 April 2008.
If you are interested in the seminar, please write an email to Daniel Loebenberger containing the keyword "Seminar Hashfunctions" in the subject.
Contents
A hash function is a deterministic method of generating from an arbitrary bit string a (relatively) small bit string that serves as a fingerprint of the data.
Almost every cryptographic algorithm nowadays uses such fingerprints, and the properties of the underlying hash functions are essential for the security analysis of the algorithm.
In the seminar we will have talks on the various types of hash functions, such as MD5 and SHA-1, that are widely used nowadays. Furthermore there will be talks on recent attacks on these functions.
If you are particularly interested in a certain subject you are invited to propose it.
Schedule
- 28 April 2008: Tobias Wilken, "A General Overview of Cryptographic Hash Functions"
- 5 May 2008: Genc Begolli, "The Merkle-Damgard Construction"
- 19 May 2008: Henning Schal, "Structural Attacks on Cryptographic Hash Functions"
- 26 May 2008: Ayush Sharma, "The MD/SHA Family"
- 2 June 2008: Dinesh Kumar, "SNEFRU and it's cryptanalysis"
- 9 June 2008: No seminar!
- 16 June 2008: Ayush Sharma, "Cryptanalysis of MD4, RIPEMD and SHA-1"
- 23 June 2008: Torsten Schröder, "Hash Functions Using Symmetric Block Ciphers"
- 30 June 2008: Oliver Kröll, "Relax? Whirlpool"
Prerequisites
None.
Allocation
2 SWS, 4 credits.
- Media Informatics: Computer and Communication Technology.
- Recommendation for University of Bonn - Computer Science: A or A1, respectively.