Logical cryptanalysis with WDSat

DOI10.1007/978-3-030-80223-3_37MaRDI QIDQ2118349zbMATH OpenOpenAlexFDO

Authors Monika Trimoska, Gilles Dequen, Sorina Ionica

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) Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites work

• A crossbred algorithm for solving Boolean polynomial systems
• A machine program for theorem-proving
• A new efficient algorithm for computing Gröbner bases (F₄)
• A SAT-Based Approach for Index Calculus on Binary Elliptic Curves
• Conflict-driven XOR-clause learning
• Efficient algorithms for solving overdefined systems of multivariate polynomial equations
• Fast exhaustive search for quadratic systems in \(\mathbb {F}_2\) on FPGAs
• Hybrid approach for solving multivariate systems over finite fields
• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
• Summation polynomial algorithms for elliptic curves in characteristic two
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing

Describes a project that uses

Uses Software

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

This page was built for publication: Logical cryptanalysis with WDSat

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