HAVAL - A One-way Hashing Algorithm with Variable Length of Output (1993) [39 citations — 16 self]
Download:
|
|
by Yuliang Zheng, Josef Pieprzyk, Jennifer Seberry
ftp://ftp.cert.dfn.de/pub/docs/crypt/ripem.msu.edu/haval-hash-paper.ps.gz
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@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
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
