Using SAT solvers in large scale distributed algebraic attacks against low entropy keys

DOI10.1515/TMMP-2015-0048MaRDI QIDQ2787218zbMATH OpenOpenAlexFDO

Authors Viliam Hromada, Ladislav Öllős, Pavol Zajac

Publication date 24 February 2016

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

Full work available at URL https://doi.org/10.1515/tmmp-2015-0048

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Applications of SAT solvers in cryptanalysis: finding weak keys and preimages
• Algebraic attacks using SAT-solvers
• Two philosophies for solving non-linear equations in algebraic cryptanalysis
• Algebraic Attacks Using IP-Solvers
• A comparison of local reduction and SAT-solver based algebraic cryptanalysis of JH and Keccak

Cited in

(5)

• Applications of SAT Solvers to Cryptanalysis of Hash Functions
• A new representation of S-boxes for algebraic differential cryptanalysis
• ALIAS: a modular tool for finding backdoors for SAT
• Algebraic attacks using SAT-solvers
• A comparison of local reduction and SAT-solver based algebraic cryptanalysis of JH and Keccak

This page was built for publication: Using SAT solvers in large scale distributed algebraic attacks against low entropy keys

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