This criterion is simpler than previous works in the literature. Based on the criterion, we can get many results from this criterion, and we can get a conclusion on such class of blockcipher-based hash functions. We solved the open problem left by Hirose. Our results show that to build a secure double call DBL compression function, it is required $k >= m+1$ where $m$ is the number of message blocks. Thus, we can only build rate 1/2 secure double DBL blockcipher-based compression functions if $k==2$.
At last, we pointed out flaws in Stam's theorem about supercharged functions and gave a revision of this theorem and added another condition for the security of supercharged compression functions.Category / Keywords: secret-key cryptography / Date: received 15 Dec 2010 Contact author: luoyiyuan at gmail com Available format(s): PDF | BibTeX Citation Version: 20101221:152146 (All versions of this report) Short URL: ia.cr/2010/642 Discussion forum: Show discussion | Start new discussion