【24h】

Improved Collision Search for SHA-0

机译:改进的SHA-0碰撞搜索

获取原文
获取原文并翻译 | 示例

摘要

At CRYPTO2005, Xiaoyun Wang, Hongbo Yu and Yiqun Lisa Yin proposed a collision attack on SHA-0 that could generate a collision with complexity 2~(39) SHA-0 hash operations. Although the method of Wang et al. can find messages that satisfy the sufficient conditions in steps 1 to 20 by using message modification, it makes no mention of the message modifications needed to yield satisfaction of the sufficient conditions in steps 21 and onwards. In this paper, first, we give sufficient conditions for the steps from step 21, and propose submarine modification as the message modification technique that will ensure satisfaction of the sufficient conditions from steps 21 to 24. Submarine modification is an extension of the multimessage modification used in collision attacks on the MD-family. Next, we point out that the sufficient conditions given by Wang et al. are not enough to generate a collision with high probability; we rectify this shortfall by introducing two new sufficient conditions. The combination of our newly found sufficient conditions and submarine modification allows us to generate a collision with complexity 236 SHA-0 hash operations. At the end of this paper, we show the example of a collision generated by applying our proposals.
机译:在CRYPTO2005上,王晓云,于洪波和尹逸群提出了对SHA-0的碰撞攻击,该攻击可能会产生具有2〜(39)个SHA-0哈希运算复杂度的碰撞。虽然王等人的方法。通过使用消息修改,用户可以找到满足步骤1到20中的充分条件的消息,而没有提到要满足步骤21和后续步骤中的充分条件所需的消息修改。在本文中,首先,我们为步骤21的步骤提供了足够的条件,并提出了将潜艇修改作为消息修改技术,以确保满足从步骤21到步骤24的充分条件。潜艇修改是所使用的多消息修改的扩展在MD系列的碰撞攻击中接下来,我们指出Wang等人给出的充分条件。不足以产生高可能性的碰撞;我们通过引入两个新的充分条件来纠正这一不足。我们新发现的足够条件和潜艇修改的结合使我们能够生成具有复杂度236 SHA-0哈希运算的冲突。在本文的最后,我们展示了通过应用建议而产生的碰撞的示例。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号