Paper 2018/1191 Original: eprint.iacr.org/2018/1191 ↗
Cryptanalysis of 2-round KECCAK-384
Abstract
In this paper, we present a cryptanalysis of round reduced Keccak-384 for 2 rounds. The best known preimage attack for this variant of Keccak has the time complexity $2^{129}$. In our analysis, we find a preimage in the time complexity of $2^{89}$ and almost same memory is required.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2018-12-10: last updated
- 2018-12-10: published
- Short URL
- https://ia.cr/2018/1191
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2018/1191,
author = {Rajendra Kumar and Nikhil Mittal and Shashank Singh},
title = {Cryptanalysis of 2-round KECCAK-384},
howpublished = {Cryptology {ePrint} Archive, Paper 2018/1191},
year = {2018},
url = {https://eprint.iacr.org/2018/1191}
}