通信学报
• 学术论文 • 上一篇 下一篇
邹剑1,2,吴文玲1,吴双1,董乐1,2
出版日期:
发布日期:
基金资助:
Online:
Published:
摘要: 提出了对DHA-256散列函数37轮的原像攻击以及39轮的伪碰撞攻击。基于中间相遇攻击,利用Biclique方法可以改进之前对DHA-256的原像分析结果,将攻击轮数从原来的35轮提高到了37轮。通过上述方法还可以构造对DHA-256的39轮伪碰撞。最终,以2255.5的时间复杂度以及23的空间复杂度构造了对DHA-256的37轮原像,并以2127.5的时间复杂度以及常数2的空间复杂度构造了对DHA-256的39轮伪碰撞。这是目前对DHA-256最好的原像与碰撞攻击结果。
Abstract: A preimage attack on DHA-256 hash function reduced to 37-round and a pseudo collision attack on the function reduced to 39-round were proposed respectively. Based on the meet-in-the-middle attack, the Biclique technique was used to improve the preimage attack from 35-round to 37-round. A 39-round pseudo collision was achieved using the Biclique technique. Overall, a preimage of DHA-256 was constructed with a complexity of and a memory of . Besides, a pseudo collision of DHA-256 was proposed with a complexity of . These are the best results of preimage and collision attack on DHA-256 hash function.
邹剑1,2,吴文玲1,吴双1,董乐1,2. 对缩减轮数DHA-256的原像与伪碰撞攻击[J]. 通信学报.
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.infocomm-journal.com/txxb/CN/
https://www.infocomm-journal.com/txxb/CN/Y2013/V34/I6/2