Rotational Cryptanalysis of Round-Reduced Keccak

  • Paweł Morawiecki
  • Josef Pieprzyk
  • Marian Srebrny
Conference paper

DOI: 10.1007/978-3-662-43933-3_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8424)
Cite this paper as:
Morawiecki P., Pieprzyk J., Srebrny M. (2014) Rotational Cryptanalysis of Round-Reduced Keccak. In: Moriai S. (eds) Fast Software Encryption. FSE 2013. Lecture Notes in Computer Science, vol 8424. Springer, Berlin, Heidelberg

Abstract

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-\(f\)[1600] permutation — the main building block of Keccak hash function.

Keywords

Preimage attack Keccak Rotational cryptanalysis SHA-3 

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Paweł Morawiecki
    • 1
    • 3
  • Josef Pieprzyk
    • 2
  • Marian Srebrny
    • 1
    • 3
  1. 1.Section of InformaticsUniversity of CommerceKielcePoland
  2. 2.Department of ComputingMacquarie UniversitySydneyAustralia
  3. 3.Institute of Computer SciencePolish Academy of SciencesWarsawPoland

Personalised recommendations