**Domain Extenders for UOWHF: A Finite Binary Tree Algorithm**

*Palash Sarkar*

**Abstract: **We obtain a {\em finite} binary tree algorithm to extend the domain of a UOWHF.
The associated key length expansion is only a constant number of bits more than
the minimum possible. Our finite binary tree algorithm is a practical
parallel algorithm to securely extend the domain of a UOWHF. Also the speed-up
obtained by our algorithm is approximately proportional to the number of processors.

**Category / Keywords: **UOWHF, hash function, binary tree

**Date: **received 20 Jan 2003, last revised 16 Feb 2004

**Contact author: **palash at isical ac in

**Available format(s): **Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation

**Version: **20040216:090403 (All versions of this report)

**Short URL: **ia.cr/2003/009

**Discussion forum: **Show discussion | Start new discussion

[ Cryptology ePrint archive ]