A SAT-based preimage analysis of reduced KECCAK hash functions

@article{Morawiecki2010ASP,
  title={A SAT-based preimage analysis of reduced KECCAK hash functions},
  author={Pawel Morawiecki and Marian Srebrny},
  journal={Inf. Process. Lett.},
  year={2010},
  volume={113},
  pages={392-397}
}
In this paper, we present a preimage attack on reduced ver­ sions 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 [2]. We found preimages for some reduced versions of the function and showed that full Keccak function is secure against the presented attack. 
Highly Cited
This paper has 90 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 30 extracted citations

An efficient SAT-based algorithm for finding short cycles in cryptographic algorithms

2018 IEEE International Symposium on Hardware Oriented Security and Trust (HOST) • 2018
View 1 Excerpt

Cryptanalysis of 1-Round KECCAK

IACR Cryptology ePrint Archive • 2017
View 1 Excerpt

SHA-1 , SAT-solving , and CNF

View 2 Excerpts
Method Support

91 Citations

01020'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 91 citations based on the available data.

See our FAQ for additional information.