Welcome to the resource topic for
**2003/009**

**Title:**

Domain Extenders for UOWHF: A Finite Binary Tree Algorithm

**Authors:**
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.

**ePrint:**
https://eprint.iacr.org/2003/009

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 .