Paper 2023/101
Practical Preimage Attack on 3-Round Keccak-256
Abstract
This paper combines techniques from several previous papers with some modifications to improve the previous cryptanalysis of 3-round Keccak-256. Furthermore, we propose a fast rebuilding method to improve the efficiency of solving equation systems. As a result, the guessing times of finding a preimage for 3-round Keccak-256 are decreased from $2^{65}$ to $2^{52}$, and the solving time of each guess is decreased from $2^{9}$ 3-round Keccak calls to $2^{5.3}$ 3-round Keccak calls. We identify a preimage of all '0' digest for 3-round Keccak-256 to support the effectiveness of our methodology.
Metadata
- Available format(s)
-
PDF
- Category
- Attacks and cryptanalysis
- Publication info
- Preprint.
- Keywords
- KeccakSHA-3Preimage attackLinear structure
- Contact author(s)
-
lxe21 @ mails tsinghua edu cn
he-l17 @ mails tsinghua edu cn
yuhongbo @ mail tsinghua edu cn - History
- 2023-01-27: approved
- 2023-01-27: received
- See all versions
- Short URL
- https://ia.cr/2023/101
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/101,
author = {Xiaoen Lin and Le He and Hongbo Yu},
title = {Practical Preimage Attack on 3-Round Keccak-256},
howpublished = {Cryptology ePrint Archive, Paper 2023/101},
year = {2023},
note = {\url{https://eprint.iacr.org/2023/101}},
url = {https://eprint.iacr.org/2023/101}
}
