作者: Martijn Stam
DOI: 10.1007/978-3-642-03317-9_5
关键词: Cipher 、 Algorithm 、 Generalization 、 Collision resistance 、 Block cipher 、 Hash function 、 Computer science 、 Compression (functional analysis)
摘要: We revisit the rate-1 blockcipher based hash functions as first studied by Preneel, Govaerts and Vandewalle (Crypto'93) later extensively analysed Black, Rogaway Shrimpton (Crypto'02). analyse a further generalization where any pre- postprocessing is considered. This leads to clearer understanding of current classification schemes introduced Preneel et al. refined Black In addition, we also gain insight in chopped, overloaded supercharged compression functions. latter category propose two on single call whose collision resistance exceeds birthday bound cipher's blocklength.