Welcome to the resource topic for 2007/239
Title:
Making Large Hash Functions From Small Compression Functions
Authors: William R. Speirs, 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.
ePrint: https://eprint.iacr.org/2007/239
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .