CryptoDB
Hash Function Design Principles Supporting Variable Output Lengths from One Small Function
Authors: | |
---|---|
Download: | |
Abstract: | In this paper, we introduce new hash function design principles with variable output lengths (multiple of $n$). It is based on a function or a block cipher which has output size $n$. In the random oracle model it has optimal collision resistance which requires $\Theta(2^{(t+1)n/2})$ queries to find $(t+1)n$-bit hash output collisions, where $t$ is any positive integer. Similarly, in the ideal cipher model, $\Theta(2^{(t+1)n/2})$ queries are required to find $(t+1)n$-bit hash output collisions. |
BibTeX
@misc{eprint-2007-13696, title={Hash Function Design Principles Supporting Variable Output Lengths from One Small Function}, booktitle={IACR Eprint archive}, keywords={secret-key cryptography / Hash function}, url={http://eprint.iacr.org/2007/416}, note={ pointchang@gmail.com 13817 received 30 Oct 2007}, author={Donghoon Chang and Mridul Nandi and Jesang Lee and Jaechul Sung and Seokhie Hong}, year=2007 }