Theory and Analysis of Cryptographic Hash Functions

散列函数是对称密码学中的基本原语，与非对称密码学也有很大的相关性。散列函数既不需要秘密密钥，也不需要公钥，用于从任意大小的消息中生成固定大小的短“指纹”。有两种非常不同的方法来研究散列函数的安全性。一个关注赤字，另一个关注正式证据。也就是说，要么仔细分析哈希函数的潜在缺陷和弱点，要么形式化地证明给定哈希函数在某些假设下和在某些理论模型内保持的某些安全属性。该项目应该将这两种方法相互结合--更多的理论方法来证明良好的性质，以及更实际的方法来搜索攻击。此外，该项目还考虑了哈希函数在实践中的用途。在实践中，哈希函数应该满足哪些要求(安全要求，但也包括功能要求)才能安全、高效和轻松地使用？

Hash functions are essential primitives in Symmetric Cryptography, with great relevance for Asymmetric Cryptography as well. Hash functions require neither secret nor public keys and are used to generate short "fingerprints" of a fixed size from arbitrarily sized messages.There are two very different approaches to study the security of hash functions. one focuses on deficits, the other one on formal proofs. I.e., either a hash function is carefully analysed for potential flaws and weaknesses, or one formally proofs certain security properties for a given hash function to hold under certain assumptions, and within certain theoretical models. The project shall combine both approaches with each other -- the more theoretical approach to prove good properties and the more practical approach to search for attacks. Additionally, the project considers what hash functions are used for, in practice. Which requirements (security requirements, but also functional requirements) shall a hash function satisfy to be used secure, efficiently and at ease, in practice?