For solving systems of Boolean polynomials whose zeros are known to be contained in F2n, algebraic solvers such as the Boolean Border Basis Algorithm (BBBA) and SAT solvers use very different and possibly complementary methods to create new information. Based on suitable implementations of these solvers and conversion methods from Boolean polynomials to SAT clauses and back, we describe an automatic framework integrating the two solving techniques and exchanging newly found information between them. Using examples derived from cryptographic attacks, we present some initial experiments indicating the efficiency of this combination.
CITATION STYLE
Horáček, J., Burchard, J., Becker, B., & Kreuzer, M. (2017). Integrating algebraic and SAT solvers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10693 LNCS, pp. 147–162). Springer Verlag. https://doi.org/10.1007/978-3-319-72453-9_11
Mendeley helps you to discover research relevant for your work.