Improved Preimage Attack on 3-Pass HAVAL  

作　　者：钟锦敏 来学嘉 段明 

机构地区：[1]Department of Computer Science and Engineering,Shanghai Jiaotong University

出　　处：《Journal of Shanghai Jiaotong university(Science)》2011年第6期713-721,共9页上海交通大学学报（英文版）

基　　金：the National Natural Science Foundation of China (Nos.60573032,60773092 and 61073149);the Research Fund for the Doctoral Program of Higher Education of China (No.20090073110027);the Fund for the Key Laboratory of Information Network Secuity of Ministry of Public Security

摘　　要：HAVAL is a hash function proposed by Zheng et al.in 1992,including 3-,4-and 5-pass versions.We improve pseudo-preimage and preimage attacks on 3-pass HAVAL at the complexity of 2 172 and 2 209.6,respectively,as compared to the previous best known results:2 192 and 2 225 by Sasaki et al.in 2008.We extend the skip interval for partial-patching and apply the initial structure technique to find the better message chunks,and combine the indirect-partial-matching,partial-fixing and multi-neutral-word partial-fixing techniques to improve the attacks based on the meet-in-the-middle method.These are the best pseudo-preimage and preimage attacks on 3-pass HAVAL.HAVAL is a hash function proposed by Zheng et al. in 1992, including 3-, 4- and 5-pass versions. We improve pseudo-preimage and preimage attacks on 3-pass HAVAL at the complexity of 2^172 and 2^209.6, respectively, as compared to the previous best known results： 2^192 and 2^225 by Sasaki et al. in 2008. We extend the skip interval for partial-patching and apply the initial structure technique to find the better message chunks, and combine the indirect-partial-matching, partial-fixing and multi-neutral-word partial-fixing techniques to improve the attacks based on the meet-in-the-middle method. These are the best pseudo-preimage and preimage attacks on 3-pass HAVAL.

关 键 词：HASH meet-in-the-middle preimage 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]