Preimage attacks on 3, 4, and 5-pass HAVAL

41Citations
Citations of this article
33Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper proposes preimage attacks on hash function HAVAL whose output length is 256 bits. This paper has three main contributions; a preimage attack on 3-pass HAVAL at the complexity of 2225, a preimage attack on 4-pass HAVAL at the complexity of 2241, and a preimage attack on 5-pass HAVAL reduced to 151 steps at the complexity of 2241. Moreover, we optimize the computational order for brute-force attack on full 5-pass HAVAL and its complexity is 2254.89. As far as we know, the proposed attack on 3-pass HAVAL is the best attack and there is no preimage attack so far on 4-pass and 5-pass HAVAL. Note that the complexity of the previous best attack on 3-pass HAVAL is 2230. Technically, our attacks find pseudo-preimages of HAVAL by combining the meet-in-the-middle and local-collision approaches, then convert pseudo-preimages to a preimage by using a generic algorithm. © 2008 Springer Berlin Heidelberg.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Sasaki, Y., & Aoki, K. (2008). Preimage attacks on 3, 4, and 5-pass HAVAL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5350 LNCS, pp. 253–271). https://doi.org/10.1007/978-3-540-89255-7_16

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 22

76%

Researcher 3

10%

Professor / Associate Prof. 2

7%

Lecturer / Post doc 2

7%

Readers' Discipline

Tooltip

Computer Science 24

86%

Physics and Astronomy 2

7%

Design 1

4%

Engineering 1

4%

Save time finding and organizing research with Mendeley

Sign up for free