作者: Yu Sasaki , Kazumaro Aoki
DOI: 10.1007/978-3-540-89255-7_16
关键词:
摘要: This paper proposes preimage attacks on hash function HAVAL whose output length is 256 bits. has three main contributions; a attack 3-pass at the complexity of 2225, 4-pass 2241, and 5-pass reduced to 151 steps 2241. Moreover, we optimize computational order for brute-force full its 2254.89. As far as know, proposed best there no so HAVAL. Note that previous 2230. Technically, our find pseudo-preimages by combining meet-in-the-middle local-collision approaches, then convert using generic algorithm.