Construction of UOWHF: Tree Hashing Revisited

Palash Sarkar

Paper 2002/058

Construction of UOWHF: Tree Hashing Revisited

Palash Sarkar

Abstract

We present a binary tree based parallel algorithm for extending the domain of a UOWHF. The key length expansion is $2 m$ bits for $t = 2$ ; $m (t + 1)$ bits for $3 \leq t \leq 6$ and $m \times (t + ⌊ \log_{2} (t - 1) ⌋)$ 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.

Note: The revision removes some minor but potentially confusing typos.

Metadata

Available format(s): PS
Publication info: Published elsewhere. Unknown where it was published
Keywords: UOWHF hash function binary tree
Contact author(s): palash @ isical ac in
History: 2004-02-16: last of 2 revisions; 2002-05-13: received; See all versions
Short URL: https://ia.cr/2002/058
License: CC BY

BibTeX

@misc{cryptoeprint:2002/058,
      author = {Palash Sarkar},
      title = {Construction of {UOWHF}: Tree Hashing Revisited},
      howpublished = {Cryptology {ePrint} Archive, Paper 2002/058},
      year = {2002},
      url = {https://eprint.iacr.org/2002/058}
}