Welcome to the resource topic for 2002/031
Title:
A Parallelizable Design Principle for Cryptographic Hash Functions
Authors: Palash Sarkar, Paul J. Schellenberg
Abstract:We describe a parallel design principle for hash functions. Given a secure hash
function h:\{0,1\}^n\rightarrow \{0,1\}^m with n\geq 2m, and a binary tree of
2^t processors we show how to construct a secure hash function h^{*} which can hash
messages of lengths less than 2^{n-m} and a secure hash function h^{\infty} which can
hash messages of arbitrary length. The number of parallel rounds required to hash a
message of length L is \lfloor\frac{L}{2^t}\rfloor+t+2. Further, our algorithm is incrementally
parallelizable in the following sense : given a digest produced using a binary tree of 2^t
processors, we show that the same digest can also be produced using a binary tree of
2^{t^{\prime}} (0\leq t^{\prime}\leq t) processors.
ePrint: https://eprint.iacr.org/2002/031
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 .