Go home now Header Background Image
Submission Procedure
share: |
Follow us
Volume 11 / Issue 6

available in:   PDF (259 kB) PS (86 kB)
Similar Docs BibTeX   Write a comment
Links into Future
DOI:   10.3217/jucs-011-06-1040


Domain Extenders for UOWHF: A Finite Binary Tree Algorithm

Palash Sarkar (Indian Statistical Institute, India)

Abstract: We obtain a finite binary tree algorithm to extend the domain of a universal one-way hash function (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.

Keywords: UOWHF, binary tree, hash function

Categories: E.3