Domain Extenders for UOWHF: A Finite Binary Tree Algorithm

Palash Sarkar

Paper 2003/009

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.

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: revised; 2003-01-20: received; See all versions
Short URL: https://ia.cr/2003/009
License: CC BY

BibTeX

@misc{cryptoeprint:2003/009,
      author = {Palash Sarkar},
      title = {Domain Extenders for UOWHF: A Finite Binary Tree Algorithm},
      howpublished = {Cryptology ePrint Archive, Paper 2003/009},
      year = {2003},
      note = {\url{https://eprint.iacr.org/2003/009}},
      url = {https://eprint.iacr.org/2003/009}
}