[Resource Topic] 2002/058: Construction of UOWHF: Tree Hashing Revisited

Welcome to the resource topic for 2002/058

Construction of UOWHF: Tree Hashing Revisited

Authors: Palash Sarkar


We present a binary tree based parallel algorithm for extending the domain of a UOWHF.
The key length expansion is 2m bits for t=2; m(t+1) bits for 3\leq t\leq 6 and
m\times(t+\lfloor\log_2 (t-1)\rfloor) bits for t\geq 7, where m is the length
of the message digest and t\geq 2 is the height of the binary tree.

ePrint: https://eprint.iacr.org/2002/058

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 .