On the one hand, cryptographic hash functions are unusual cryptographic algorithms. In comparison with block ciphers or MACs they work without a key. On the other hand, they are the beasts of burden in many applications. These hash functions mainly appear in cryptographic protocols, such as SSH, SSL, and RSA-OAEP. Since 2000, cryptographers have found some crucial weaknesses in common cryptographic hash functions, e.g., MD5 and SHA-1. Only the SHA-2 family seems to be resistant against published attacks. As the structure of SHA-2 is similar to the structure of SHA-1, the National Institute of Standards and Technlogy (NIST) introduced a public hash function challenge (SHA-3 contest) to find a new standard, 64 first-round candidates were submitted, including two candidates designed by the chair of Media Security in Weimar. One of them (Skein) is one out of the five finalists. The first part of this course introduces cryptographic hash functions and their application in practice. The second part will show generic attacks and their impact in practice. Furthermore, this course will teach you approaches used for the design of a cryptographic hash function. The third part is about the finalists of the SHA-3 competition. Additionally, there might be another part about password hashing due to the Password Hashing Competition (PHC) which currently takes place to find a new password hash algorithm.
Veranstaltungsnummer: 4345550
- Trainer/in: Nathalie Jolanthe Lang
- Trainer/in: Jannis Leuther
- Trainer/in: Stefan Lucks
