
AbstractWe present a binary tree based parallel algorithm for extending the domain of a universal one-way hash function (UOWHF). For t⩾2, our algorithm extends the domain from the set of all n-bit strings to the set of all ((2t-1)(n-m)+m)-bit strings, where m is the length of the message digest. The associated increase in key length is 2m bits for t=2; m(t+1) bits for 3⩽t⩽6 and m×(t+⌊log2(t-1)⌋) bits for t⩾7.
UOWHF, Applied Mathematics, Cryptographic hash functions, Parallel computation, Discrete Mathematics and Combinatorics, Binary tree
UOWHF, Applied Mathematics, Cryptographic hash functions, Parallel computation, Discrete Mathematics and Combinatorics, Binary tree
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
