A New Tree based Domain Extension of UOWHF

Mridul Nandi

Paper 2003/142

A New Tree based Domain Extension of UOWHF

Mridul Nandi

Abstract

We present a new binary tree based parallel algorithm for extending the domain of a UOWHF. The key length expansion is m(t+O(log*(t))) bits. In particular, the key length expansion is 2m bits for t=2; m(t+1) bits for 3\leq t\leq 6 and m(t+2) bits for 7\leq t\leq 134, where m is the length of the message digest and t\geq 2 is the height of the binary tree. The previously best known binary tree algorithm required a key length expansion of m(t+[log_2 (t-1)]) bits. We also give a sufficient condition for valid domain extension in sequental domain extension.

Metadata

Available format(s): PS
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): hi_mridul @ yahoo com
History: 2003-08-26: revised; 2003-07-24: received; See all versions
Short URL: https://ia.cr/2003/142
License: CC BY

BibTeX

@misc{cryptoeprint:2003/142,
      author = {Mridul Nandi},
      title = {A New Tree based Domain Extension of {UOWHF}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2003/142},
      year = {2003},
      url = {https://eprint.iacr.org/2003/142}
}