Rotational cryptanalysis of round-reduced Keccak

Paweł Morawiecki*, Josef Pieprzyk, Marian Srebrny

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

46 Citations (Scopus)


In this paper we attack round-reduced Keccak hash function with a technique called rotational cryptanalysis. We focus on Keccak variants proposed as SHA-3 candidates in the NIST's contest for a new standard of cryptographic hash function. Our main result is a preimage attack on 4-round Keccak and a 5-round distinguisher on Keccak- [1600] permutation - the main building block of Keccak hash function.

Original languageEnglish
Title of host publicationFast Software Encryption - 20th International Workshop, FSE 2013, Revised Selected Papers
EditorsShiho Moriai
Place of PublicationHeidelberg
PublisherSpringer, Springer Nature
Number of pages22
Volume8424 LNCS
ISBN (Print)9783662439326
Publication statusPublished - 2014
Event20th International Workshop on Fast Software Encryption, FSE 2013 - Singapore, Singapore
Duration: 11 Mar 201313 Mar 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8424 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other20th International Workshop on Fast Software Encryption, FSE 2013


  • Keccak
  • Preimage attack
  • Rotational cryptanalysis
  • SHA-3


Dive into the research topics of 'Rotational cryptanalysis of round-reduced Keccak'. Together they form a unique fingerprint.

Cite this