Logical cryptanalysis with WDSat

DOI10.1007/978-3-030-80223-3_37OpenAlexW3184210473MaRDI QIDQ2118349

Gilles Dequen, Sorina Ionica, Monika Trimoska

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_37

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Uses Software

• March_eq
• MiniSat
• GitHub
• CaDiCaL
• Paracooba
• Kissat

Cites Work

• Unnamed Item
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
• A crossbred algorithm for solving Boolean polynomial systems
• Conflict-Driven XOR-Clause Learning
• Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two
• Fast Exhaustive Search for Quadratic Systems in $$\mathbb {F}_{2}$$ on FPGAs
• Hybrid approach for solving multivariate systems over finite fields
• A SAT-Based Approach for Index Calculus on Binary Elliptic Curves
• Theory and Applications of Satisfiability Testing
• A machine program for theorem-proving
• Theory and Applications of Satisfiability Testing

This page was built for publication: Logical cryptanalysis with WDSat