Abstract
HAVAL is a cryptographic hash function proposed in 1992 by Zheng, Pieprzyk and Seberry. Its structure is quite similar to other widely used hash functions such as MD5 and SHA-1. The specification of HAVAL includes a security parameter: the number of passes (that is, the number of times that a particular word of the message is used in the computation) which can be chosen equal to 3, 4 or 5. In this paper we cryptanalyze the compression functions of the 4-pass and the 5-pass HAVAL using differential cryptanalysis. We show that each of these two functions can be distinguished from a truly random function. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Yoshida, H., Biryukov, A., De Cannière, C., Lano, J., & Preneel, B. (2005). Non-randomness of the full 4 and 5-pass HAVAL. In Lecture Notes in Computer Science (Vol. 3352, pp. 324–336). Springer Verlag. https://doi.org/10.1007/978-3-540-30598-9_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
