A comparison of local reduction and SAT-solver based algebraic cryptanalysis of JH and Keccak

DOI10.2478/V10127-012-0036-6MaRDI QIDQ4906254zbMATH OpenOpenAlexFDO

Authors Peter Adamček, Marek Loderer, Pavol Zajac

Publication date 11 February 2013

Published in Tatra Mountains Mathematical Publications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL http://tatra.mat.savba.sk/Full/53/01a-l-z.pdf

zbMATH Keywords

algebraic cryptanalysisJHKeccaklocal reduction

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Cryptography (94A60)

Recommendations

• Using SAT solvers in large scale distributed algebraic attacks against low entropy keys
• A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions
• Algebraic attacks using SAT-solvers
• Applications of SAT solvers in cryptanalysis: finding weak keys and preimages
• Methods to solve algebraic equations in cryptanalysis

Cited in

(2)

• Using SAT solvers in large scale distributed algebraic attacks against low entropy keys
• Solving sparse MRHS systems with genetic algorithms

This page was built for publication: A comparison of local reduction and SAT-solver based algebraic cryptanalysis of JH and Keccak

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4906254)