Paper 2002/058 Original: eprint.iacr.org/2002/058 ↗
Construction of UOWHF: Tree Hashing Revisited
Abstract
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.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2004-02-16: last updated
- 2002-05-13: published
- Short URL
- https://ia.cr/2002/058
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}