Cryptology ePrint Archive: Report 2010/285

A SAT-based preimage analysis of reduced KECCAK hash functions

Pawel Morawiecki and Marian Srebrny

Abstract: In this paper, we present a preimage attack on reduced versions of Keccak hash functions. We use our recently developed toolkit CryptLogVer for generating CNF (conjunctive normal form) which is passed to the SAT solver PrecoSAT. We found preimages for some reduced versions of the function and showed that full Keccak function is secure against the presented attack.

Category / Keywords: preimage attack, Keccak, satisfiability, algebraic cryptanalysis, logical cryptanalysis, SAT solvers

Publication Info: The paper was presented at Second SHA3 Candidate Conference, Santa Barbara 2010

Date: received 13 May 2010, last revised 19 Oct 2010

Contact author: pawelm at wsh-kielce edu pl

Available format(s): PDF | BibTeX Citation

Version: 20101019:140641 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]