## CryptoDB

### Paper: Improved Preimage Attacks on 3-Round Keccak-224/256

Authors: Xiaoen Lin , Department of Computer Science and Technology, Tsinghua University, Beijing, China Le He , Department of Computer Science and Technology, Tsinghua University, Beijing, China Hongbo Yu , Department of Computer Science and Technology, Tsinghua University, Beijing, China DOI: 10.46586/tosc.v2021.i3.84-101 URL: https://tosc.iacr.org/index.php/ToSC/article/view/9175 Search ePrint Search Google In this paper, we provide an improved method on preimage attacks of standard 3-round Keccak-224/256. Our method is based on the work by Li and Sun. Their strategy is to find a 2-block preimage instead of a 1-block one by constructing the first and second message blocks in two stages. Under this strategy, they design a new linear structure for 2-round Keccak-224/256 with 194 degrees of freedom left, which is able to construct the second message block with a complexity of 231/262. However, the bottleneck of this strategy is that the first stage needs much more expense than the second one. Therefore, we improve the first stage by using two techniques. The first technique is constructing multi-block messages rather than one-block message in the first stage, which can reach a better inner state. The second technique is setting restricting equations more efficiently, which can work in 3-round Keccak-256. As a result, the complexity of finding a preimage for 3-round Keccak-224/256 can be decreased from 238/281 to 232/265.
##### BibTeX
@article{tosc-2021-31497,
title={Improved Preimage Attacks on 3-Round Keccak-224/256},
journal={IACR Transactions on Symmetric Cryptology},
publisher={Ruhr-Universität Bochum},
volume={2021, Issue 3},
pages={84-101},
url={https://tosc.iacr.org/index.php/ToSC/article/view/9175},
doi={10.46586/tosc.v2021.i3.84-101},
author={Xiaoen Lin and Le He and Hongbo Yu},
year=2021
}