Paper 2003/158
A Sufficient Condition and Optimal Domain Extension of UOWHF
Mridul Nandi
Abstract
Here, we present how one can extend domain of a given Hash Family. We will give a sufficient condition for UOWHF-preserving domain extension (the extended Hash Family is UOWHF whenever the base Hash Family is UOWHF). We present also a binary tree based parallel algorithm for extending the domain of a UOWHF whose key-length expansion is optimum in a sub-class of binary tree based domain extension algorithm. We will show the optimality under an assumption.
Metadata
- Available format(s)
- PS
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Hash functionUOWHFDomain Extension Algorithmstrongly even-free masking assignment
- Contact author(s)
- hi_mridul @ yahoo com
- History
- 2004-02-02: last of 3 revisions
- 2003-08-07: received
- See all versions
- Short URL
- https://ia.cr/2003/158
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2003/158,
author = {Mridul Nandi},
title = {A Sufficient Condition and Optimal Domain Extension of {UOWHF}},
howpublished = {Cryptology {ePrint} Archive, Paper 2003/158},
year = {2003},
url = {https://eprint.iacr.org/2003/158}
}
