Generating additional constraints in algebraic cryptanalysis using SAT oracles

DOI10.17223/2226308X/14/23MaRDI QIDQ6898749zbMATH OpenFDO

Authors Aleksandr Anatol'evich Semënov, K. V. Antonov, I. A. Gribanova

Publication date 17 November 2025

Published in Prikladnaya Diskretnaya Matematika. Supplement (Search for Journal in Brave)

zbMATH Keywords

algebraic cryptanalysisBoolean satisfiability problem (SAT)SAT oracleMQ systems of equations over GF(2)

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 4085569 (Why is no real title available?)
• scientific article; zbMATH DE number 3489106 (Why is no real title available?)
• scientific article; zbMATH DE number 1418284 (Why is no real title available?)
• scientific article; zbMATH DE number 7199588 (Why is no real title available?)
• Algebraic Cryptanalysis
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• The complexity of theorem-proving procedures
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(1)

• Chosen plaintext algebraic attacks on the ciphers from the Simon family

This page was built for publication: Generating additional constraints in algebraic cryptanalysis using SAT oracles

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