CryptoDB
Domain Extenders for UOWHF: A Finite Binary Tree Algorithm
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2003-11727, title={Domain Extenders for UOWHF: A Finite Binary Tree Algorithm}, booktitle={IACR Eprint archive}, keywords={UOWHF, hash function, binary tree}, url={http://eprint.iacr.org/2003/009}, note={ palash@isical.ac.in 12464 received 20 Jan 2003, last revised 16 Feb 2004}, author={Palash Sarkar}, year=2003 }