23步和24步SHA-512的冲突消息对
Colliding Message Pairs for 23 and 24-step SHA-512
摘要：
最近，Indesteeege等人[1]在SAC '08上描述了对23和24步SHA-512的攻击。他们的攻击基于Nikolic和Biryukov的差分路径[2]。所报告的复杂度是对相应阶跃简化的SHA-512散列函数的$2^{44.9}$和$2^{53}$调用。他们为23步SHA-512提供了冲突消息对，但没有为24步SHA-512提供冲突消息对。在本文中，我们提供了23步SHA-512的冲突消息对和24步SHA-512的第一个冲突消息对。我们的攻击使用Sanadhya和Sarkar在ACISP '08 [3]中首次描述的差分路径。我们的攻击的复杂性是$2^{16.5}$和$2^{34.5}$调用各自的步骤减少SHA-512哈希函数。关于这些攻击的详细情况，将在本说明的扩展版中提供。
英文摘要：
Recently, Indesteege et al. [1] had described attacks against 23 and 24-step SHA-512 at SAC '08. Their attacks are based on the differential path by Nikolic and Biryukov [2]. The reported complexities are $2^{44.9}$ and $2^{53}$ calls to the respective step reduced SHA-512 hash function. They provided colliding message pairs for 23-step SHA-512 but did not provide a colliding message pair for 24-step SHA-512. In this note we provide a colliding message pair for 23-step SHA-512 and the first colliding message pair for 24-step SHA-512. Our attacks use the differential path first described by Sanadhya and Sarkar at ACISP '08 [3]. The complexities of our attacks are $2^{16.5}$ and $2^{34.5}$ calls to the respective step reduced SHA-512 hash function. Complete details of the attacks will be provided in an extended version of this note.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
