摘要
根据杂凑函数HAVAL算法中消息字的顺序和第一圈中圈函数的性质,结合使用"中间相遇攻击"和穷举搜索等方法,给出从第3步到第122步HAVAL压缩函数的原根攻击。分别采用中间相遇方法和树方法,把对120步压缩函数的原根攻击扩展到对120步HAVAL算法的原根攻击。
According to the order of the message words in HAVAL algorithm and the property of the function in the first pass, a preimage attack of the compression function from step 3 to step 122 was proposed by using "meeting-in-the-middle attack" and the exhaustive search method. The preimage attack on the 120-step reduced compression function was extended to the preimage attack on the 120-step reduced HAVAL by using " meeting-in-the-middle method" and the tree method respectively.
出处
《计算机应用》
CSCD
北大核心
2009年第5期1327-1329,共3页
journal of Computer Applications
基金
东华大学校基金项目(112-10-0044018)