We generalize our techniques used in the proof of Abreast-DM to a huge class of double block length (DBL) hash functions that we will call Cyclic-DM. Using this generalized theorem we are able to derive several DBL constructions that lead to compression functions that even have a higher security guarantee and are more efficient than Abreast-DM. Furthermore we give DBL constructions that have the highest security guarantee of all DBL compression functions currently known in literature. We also provide an analysis of preimage resistance for Cyclic-DM compression functions. Note that this work has been already presented at Dagstuhl '09.
Category / Keywords: secret-key cryptography / cryptographic hash function, block cipher based, proof of security, double-block length, ideal cipher model, Abreast-DM Date: received 2 Jun 2009 Contact author: ewan fleischmann at uni-weimar de Available format(s): PDF | BibTeX Citation Version: 20090603:102305 (All versions of this report) Discussion forum: Show discussion | Start new discussion