TY - GEN
T1 - New Collision Attacks on Round-Reduced SHA-512
AU - Li, Yingxin
AU - Liu, Fukang
AU - Wang, Gaoli
AU - Qian, Haifeng
AU - Jia, Keting
AU - Kong, Xiangyu
N1 - Publisher Copyright:
© International Association for Cryptologic Research 2025.
PY - 2025
Y1 - 2025
N2 - The SHA-2 family primarily includes two versions, SHA-256 and SHA-512. Although a memory-efficient practical collision attack has been recently proposed for 31-step SHA-256 at ASIACRYPT 2024, the best practical collision attack on SHA-512 still only reaches 28 steps, and the best theoretic collision attack on 31-step SHA-512 has the time complexity of 297.3. This is mainly due to the large state of SHA-512 compared with SHA-256, despite their structural similarity. To enhance the collision attacks on SHA-512, we propose a new local collision by injecting difference at the message words (W9,W10,W14,W17,W19), allowing us to achieve the first practical collision attack on 29 steps of SHA-512. Moreover, to improve the collision attack on 31-step SHA-512, we improve Liu et al.’s method to model the signed difference transition through Boolean functions, by introducing a novel model to capture the 2-bit conditions, which frequently occur in SHA-512 characteristics. In this way, we can further improve the 31-step SHA-512 characteristic and reduce the time complexity of the collision attack on 31-step SHA-512 from 297.3 to 285.5.
AB - The SHA-2 family primarily includes two versions, SHA-256 and SHA-512. Although a memory-efficient practical collision attack has been recently proposed for 31-step SHA-256 at ASIACRYPT 2024, the best practical collision attack on SHA-512 still only reaches 28 steps, and the best theoretic collision attack on 31-step SHA-512 has the time complexity of 297.3. This is mainly due to the large state of SHA-512 compared with SHA-256, despite their structural similarity. To enhance the collision attacks on SHA-512, we propose a new local collision by injecting difference at the message words (W9,W10,W14,W17,W19), allowing us to achieve the first practical collision attack on 29 steps of SHA-512. Moreover, to improve the collision attack on 31-step SHA-512, we improve Liu et al.’s method to model the signed difference transition through Boolean functions, by introducing a novel model to capture the 2-bit conditions, which frequently occur in SHA-512 characteristics. In this way, we can further improve the 31-step SHA-512 characteristic and reduce the time complexity of the collision attack on 31-step SHA-512 from 297.3 to 285.5.
KW - SAT/SMT
KW - SHA-512
KW - practical collision attack
UR - https://www.scopus.com/pages/publications/105014148728
U2 - 10.1007/978-3-032-01901-1_7
DO - 10.1007/978-3-032-01901-1_7
M3 - 会议稿件
AN - SCOPUS:105014148728
SN - 9783032019004
T3 - Lecture Notes in Computer Science
SP - 200
EP - 229
BT - Advances in Cryptology – CRYPTO 2025 - 45th Annual International Cryptology Conference, Proceedings
A2 - Tauman Kalai, Yael
A2 - Kamara, Seny F.
PB - Springer Science and Business Media Deutschland GmbH
T2 - 45th Annual International Cryptology Conference, CRYPTO 2025
Y2 - 17 August 2025 through 21 August 2025
ER -