New SAT Solver Targets Cryptographic Constraints

Julian Danner and Martin Kreuzer announced a new approach to Boolean satisfiability that departs from traditional conjunctive normal form (CNF) encodings by employing an XOR-OR-AND normal form (XNF)¹.org]. Their method leverages XLIN, a propositional logic proof system equivalent to RES(⊕) and SRES, enabling compact representations of XOR-rich constraints common in cryptography¹.org].

The core idea behind Xorricane is to encode Boolean polynomial systems directly as XNF formulas, which combine exclusive OR, OR, and AND operators without expanding into CNF clauses¹.org].

They showed that XLIN’s inference rules are polynomially equivalent to those of established resolution systems, ensuring theoretical soundness¹.org].

In addition to the theoretical foundation, Danner and Kreuzer implemented their conflict-driven algorithm within a prototype solver named Xorricane. They integrated XLIN-based learning mechanisms that record conflicts arising during propagation, allowing subsequent searches to prune large portions of the search tree efficiently. Benchmarks included random instances and cryptographic examples; results demonstrate its viability compared with existing CNF-resolution solvers¹.org].

Expert commentary notes that XNF formulations excel at representing operations involving cryptographic primitives because bitwise exclusive OR appears naturally within them—a characteristic exploited extensively in side-channel attack resistance starting from Boneh et al.'s work around 2005. The equivalence between XLIN and RES(⊕) implies potential performance bottlenecks if Xorricane faces particularly complex instances; however, empirical evidence indicates efficiency gains over traditional CNF methods, especially when dealing with larger problem sizes that have historically strained CNF-based approaches since early 2010.

Xorricane represents a meaningful step toward more specialized satisfiability tools capable of handling increasingly complex constraints found in modern cryptographic protocols. Its development underscores how revisiting foundational proof systems can yield practical advances without sacrificing formal rigor.