Chosen-Prefix Collisions on AES-like Hashing
Abstract: Chosen-prefix collision (CPC) attack was first presented by Stevens, Lenstra and de Weger on MD5 at Eurocrypt 2007. A CPC attack finds a collision for any two chosen prefixes, which is a stronger variant of collision attack. CPCs are naturally harder to construct but have larger practical impact than (identical-prefix) collisions, as seen from the series of previous works on MD5 by Stevens et al. and SHA-1 by Leurent and Peyrin. Despite its significance, the resistance of CPC attacks has not been studied on AES-like hashing. In this work, we explore CPC attacks on AES-like hashing following the framework practiced on MD5 and SHA-1. Instead of the message modification technique developed for MD-SHA family, we opt for related-key rebound attack to construct collisions for AES-like hashing in view of its effectiveness. We also note that the CPC attack framework can be exploited to convert a specific class of one-block free-start collisions into two-block collisions, which sheds light .... https://ojs.ub.rub.de/index.php/ToSC/article/view/11951
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Chosen-Prefix Collisions on AES-like Hashing ; volume:2024 ; number:4 ; year:2024
IACR transactions on symmetric cryptology ; 2024, Heft 4 (2024)
- Creator
-
Chen, Shiyao
Dong, Xiaoyang
Guo, Jian
Zhang, Tianyu
- DOI
-
10.46586/tosc.v2024.i4.64-96
- URN
-
urn:nbn:de:101:1-2412181759359.549829999785
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:29 AM CEST
Data provider
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Chen, Shiyao
- Dong, Xiaoyang
- Guo, Jian
- Zhang, Tianyu