Cryptology ePrint Archive: Report 2018/1191

Cryptanalysis of 2-round KECCAK-384

Rajendra Kumar and Nikhil Mittal and Shashank Singh

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.

Category / Keywords: cryptographic protocols / KECCAK, SHA-3, hash function, pre-image

Original Publication (with minor differences): Indocrypt 2018

Date: received 9 Dec 2018

Contact author: rjndr at iitk ac in, mnikhil@iitk ac in, shashank@iiserb ac in

Available format(s): PDF | BibTeX Citation

Version: 20181210:211931 (All versions of this report)

Short URL: ia.cr/2018/1191


[ Cryptology ePrint archive ]