首页> 外文会议>International Conference on Information and Communications Security >Collision Attack for the Hash Function Extended MD4
【24h】

Collision Attack for the Hash Function Extended MD4

机译:哈希函数的碰撞攻击扩展了MD4

获取原文

摘要

Extended MD4 is a hash function proposed by Rivest in 1990 with a 256-bit hash value. The compression function consists of two different and independent parallel lines called Left Line and Right Line, and each line has 48 steps. The initial values of Left Line and Right Line are denoted by IV_0 and IV_1 respectively. Dobbertin proposed a collision attack for the compression function of Extended MD4 with a complexity of about 2~(40) under the condition that the value for IV_0 = IV_1 is prescribed. In this paper, we gave a collision attack on the full Extended MD4 with a complexity of about 2~(37). Firstly, we propose a collision differential path for both lines by choosing a proper message difference, and deduce a set of sufficient conditions that ensure the differential path hold. Then by using some precise message modification techniques to improve the success probability of the attack, we find two-block collisions of Extended MD4 with less than 2~(37) computations. This work provides a new reference to the collision analysis of other hash functions such as RIPEMD-160 etc. which consist of two lines.
机译:扩展MD4是1990年RIVEST提出的哈希函数,具有256位哈希值。压缩函数由两个不同且独立的平行线组成,称为左线和右行,每行都有48个步骤。左线和右线的初始值分别由IV_0和IV_1表示。 Dobbertin提出了在规定IV_0 = IV_1的值的条件下,在规定的条件下,为扩展MD4的压缩功能提出了延长MD4的压缩函数的碰撞攻击,其复杂性约为2〜(40)。在本文中,我们对全扩展MD4的碰撞攻击具有约2〜(37)的复杂性。首先,我们通过选择适当的消息差异来提出两条线的碰撞差分路径,并推断出一组充分的条件,以确保差分路径保持。然后,通过使用一些精确的消息修改技术来提高攻击的成功概率,我们发现扩展MD4的两个块冲突,少于2〜(37)计算。这项工作为其他散列功能的碰撞分析提供了新的研究,例如由两条线组成的Ripemd-160等。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号