HAVAL - A One-Way Hashing Algorithm with Variable Length of Output (1993)
Cached
Download Links
- [ftp.cert.dfn.de]
- [labs.calyptix.com]
- [www.calyptix.com]
- DBLP
Other Repositories/Bibliography
| Citations: | 48 - 17 self |
BibTeX
@INPROCEEDINGS{Zheng93haval-,
author = {Yuliang Zheng and Josef Pieprzyk and Jennifer Seberry},
title = {HAVAL - A One-Way Hashing Algorithm with Variable Length of Output},
booktitle = {},
year = {1993},
pages = {83--104},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A one-way hashing algorithm is a deterministic algorithm that compresses an arbitrary long message into a value of specified length. The output value represents the fingerprint or digest of the message. A cryptographically useful property of a one-way hashing algorithm is that it is infeasible to find two distinct messages that have the same fingerprint. This paper proposes a one-way hashing algorithm called HAVAL. HAVAL compresses a message of arbitrary length into a fingerprint of 128, 160, 192, 224 or 256 bits. In addition, HAVAL has a parameter that controls the number of passes a message block (of 1024 bits) is processed. A message block can be processed in 3, 4 or 5 passes. By combining output length with pass, we can provide fifteen (15) choices for practical applications where different levels of security are required. The algorithm is very efficient and particularly suited for 32-bit computers which predominate the current workstation market. Experiments show that HAVAL is 60%...
