You are looking at a specific version 20070619:200028 of this paper. See the latest version.

Paper 2007/239

Making Large Hash Functions From Small Compression Functions

William R. Speirs and Ian Molloy

Abstract

We explore the idea of creating a hash function that produces an $s$-bit digest from a compression function with an $n$-bit output, where $s > n$. % where $s\le 2^{n/2}n$.This is accomplished by truncating a hash function with a digest size of $\ell n$-bits. Our work answers the question of how large $\ell$ can be while creating a digest of $sn$-bits securely. We prove that our construction is secure with respect to preimage resistance and collision resistance for $s \le 2^{n/2}n$.

Metadata
Available format(s)
PDF PS
Category
Foundations
Publication info
Published elsewhere. Work in progress
Keywords
hash functions
Contact author(s)
bill speirs @ gmail com
History
2007-06-19: received
Short URL
https://ia.cr/2007/239
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.