散列函数
抗碰撞性
碰撞攻击
碰撞
计算机科学
功能(生物学)
订单(交换)
算法
并行计算
数学
哈希表
双重哈希
程序设计语言
生物
进化生物学
经济
财务
作者
Riham AlTawy,Aleksandar Kircanski,Amr M. Youssef
标识
DOI:10.1016/j.ipl.2013.07.015
摘要
At the Cryptographic Hash Workshop hosted by NIST in 2005, Lee et al. proposed the DHA-256 (Double Hash Algorithm-256) hash function. The design of DHA-256 builds upon the design of SHA-256, but introduces additional strengthening features such as optimizing the message expansion and step function against local collision attacks. Previously, DHA-256 was analyzed by J. Zhong and X. Lai, who presented a preimage attack on 35 steps of the compression function with complexity 2^2^3^9^.^6. In addition, the IAIK Krypto Group provided evidence that there exists a 9-step local collision for the DHA-256 compression function with probability higher than previously predicted. In this paper, we analyze DHA-256 in the context of higher order differential attacks. In particular, we provide a practical distinguisher for 42 out of 64 steps and give an example of a colliding quartet to validate our results.
科研通智能强力驱动
Strongly Powered by AbleSci AI