z-logo
open-access-imgOpen Access
Improved Meet-in-the-Middle Preimage Attacks against AES Hashing Modes
Author(s) -
Zhenzhen Bao,
Lin Ding,
Jian Guo,
Haoyang Wang,
Wenying Zhang
Publication year - 2020
Publication title -
iacr transaction on symmetric cryptology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.715
H-Index - 10
ISSN - 2519-173X
DOI - 10.46586/tosc.v2019.i4.318-347
Subject(s) - block cipher , hash function , computer science , slide attack , collision attack , key (lock) , arithmetic , computer security , theoretical computer science , mathematics , cryptography , cryptographic hash function , differential cryptanalysis , double hashing
Hashing modes are ways to convert a block cipher into a hash function, and those with AES as the underlying block cipher are referred to as AES hashing modes. Sasaki in 2011, introduced the first preimage attack against AES hashing modes with the AES block cipher reduced to 7 rounds, by the method of meet-in-the-middle. In his attack, the key-schedules are not taken into account. Hence, the same attack applies to all three versions of AES. In this paper, by introducing neutral bits from the key, extra degree of freedom is gained, which is utilized in two ways, i.e., to reduce the time complexity and to extend the attack to more rounds. As an immediate result, the complexities of 7-round pseudo-preimage attacks are reduced from 2120 to 2104, 296, and 296 for AES-128, AES-192, and AES-256, respectively. By carefully choosing the neutral bits from the key to cancel those from the state, the attack is extended to 8 rounds for AES-192 and AES-256 with complexities 2112 and 296. Similar results are obtained for Kiasu-BC, a tweakable block cipher based on AES-128, and interestingly the additional input tweak helps reduce the complexity and extend the attack to one more round. To the best of our knowledge, these are the first preimage attacks against 8-round AES hashing modes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here