A SAT-based preimage analysis of reduced KECCAK hash functions

Pawel Morawiecki; Marian Srebrny

Paper 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.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. The paper was presented at Second SHA3 Candidate Conference, Santa Barbara 2010
Keywords: preimage attack Keccak satisfiability algebraic cryptanalysis logical cryptanalysis SAT solvers
Contact author(s): pawelm @ wsh-kielce edu pl
History: 2010-10-19: revised; 2010-05-14: received; See all versions
Short URL: https://ia.cr/2010/285
License: CC BY

BibTeX

@misc{cryptoeprint:2010/285,
      author = {Pawel Morawiecki and Marian Srebrny},
      title = {A {SAT}-based preimage analysis of reduced {KECCAK} hash functions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2010/285},
      year = {2010},
      url = {https://eprint.iacr.org/2010/285}
}