Paper 2024/352
Improved Meet-in-the-Middle Nostradamus Attacks on AES-like Hashing
Abstract
The Nostradamus attack was originally proposed as a security vulnerability for a hash function by Kelsey and Kohno at EUROCRYPT 2006. It requires the attacker to commit to a hash value y of an iterated hash function H. Subsequently, upon being provided with a message prefix P, the adversary’s task is to identify a suffix S such that H(P||S) equals y. Kelsey and Kohno demonstrated a herding attack requiring
Metadata
- Available format(s)
-
PDF
- Category
- Attacks and cryptanalysis
- Publication info
- Published by the IACR in TOSC 2024
- Keywords
- Hash FunctionMeet-in-the-middle AttackAES-likeNostradamus Attack
- Contact author(s)
-
xiaoyangdong @ tsinghua edu cn
guojian @ ntu edu sg
lishun @ ucas ac cn
pham0079 @ e ntu edu sg
tianyu005 @ e ntu edu sg - History
- 2024-03-01: approved
- 2024-02-27: received
- See all versions
- Short URL
- https://ia.cr/2024/352
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/352, author = {Xiaoyang Dong and Jian Guo and Shun Li and Phuong Pham and Tianyu Zhang}, title = {Improved Meet-in-the-Middle Nostradamus Attacks on {AES}-like Hashing}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/352}, year = {2024}, url = {https://eprint.iacr.org/2024/352} }