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.
Author supplied keywords
Cite
CITATION STYLE
APA
Kumar, R., Mittal, N., & Singh, S. (2018). Cryptanalysis of 2 round KECCAK-384. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11356 LNCS, pp. 120–133). Springer Verlag. https://doi.org/10.1007/978-3-030-05378-9_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free