2026-08-17T02:48:06Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1017 2024-03-06T11:07:15Z ddc:004 open_access

A Collision-Resistant Rate-1 Double-Block-Length Hash Function Lucks, Stefan Hash function provable security double-block-length 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 $2^{122}$ 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). Schloss Dagstuhl – Leibniz-Zentrum für Informatik Stefan Lucks 2007 Is Part Of Dagstuhl Seminar Proceedings, Volume 7021, Symmetric Cryptography (2007) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.07021.3 urn:nbn:de:0030-drops-10172 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07021.3 eng https://creativecommons.org/licenses/by/4.0/legalcode