A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions

DOI10.1016/j.ipl.2013.03.004zbMath1358.94072OpenAlexW1968465898MaRDI QIDQ396606

Paweł Morawiecki, Marian Srebrny

Publication date: 13 August 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.03.004

zbMATH Keywords

cryptographyalgebraic cryptanalysishash functionsSAT solvers\textsc{Keccak}logical cryptanalysis

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Cryptanalysis of round-reduced KECCAK using non-linear structures ⋮ Linear Structures: Applications to Cryptanalysis of Round-Reduced Keccak ⋮ Exploring SAT for cryptanalysis: (quantum) collision attacks against 6-round SHA-3 ⋮ Analysis of Boomerang Differential Trails via a SAT-Based Constraint Solver URSA ⋮ Improved practical attacks on round-reduced Keccak ⋮ Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks ⋮ Practical Analysis of Reduced-Round Keccak ⋮ Applications of SAT Solvers in Cryptanalysis: Finding Weak Keys and Preimages ⋮ Preimage attacks on 4-round Keccak by solving multivariate quadratic systems

Uses Software

• PrecoSAT
• Keccak
• CryptLogVer

Cites Work

• Unnamed Item
• Unnamed Item
• How to fake an RSA signature by encoding modular root finding as a SAT problem
• SAT as a Programming Environment for Linear Algebra
• Practical Analysis of Reduced-Round Keccak
• Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
• New Attacks on Keccak-224 and Keccak-256
• Finding Collisions in the Full SHA-1
• A machine program for theorem-proving
• The complexity of theorem-proving procedures
• Applications of SAT Solvers to Cryptanalysis of Hash Functions