2007/01/01 by Stefan Lucks, Lucks, Stefan
Computer Science · #Chaos-based Image/Signal Encryption #Coding theory and cryptography #Cryptographic Implementations and Security #Hash function #double-block-length #provable security
paper · doi:10.4230/dagsemproc.07021.3
openalex publication_date 2007/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper proposes a construction for collision resistant 2n-bit hash functions, based on n-bit block ciphers with 2n-bit keys. The construction is analysed in the ideal cipher model; for n=128 an adversary would need roughly 2122 units of time to find a collision. The construction employs ``combinatorial'' hashing as an underlying building block (like Universal Hashing for cryptographic message authentication by Wegman and Carter). The construction runs at rate~1, thus improving on a similar rate~1/2 approach by Hirose (FSE 2006).