arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2311.00733cs.LOmath.ACmath.LO
收藏

使用 XOR-OR-AND 范式的 SAT 求解

SAT Solving Using XOR-OR-AND Normal Forms

Bernhard Andraschko, Julian Danner, Martin Kreuzer

AI总结:

本文提出逻辑公式的 XOR-OR-AND 范式(2-XNF),给出 CNF/ANF 到 2-XNF 的转换方法,并设计基于 DPLL 的求解器,在 ASCON-128 密码实例上优于现有方法。

摘要:

本文介绍了用于逻辑公式的 XOR-OR-AND 范式(XNF)。它是著名的合取范式(CNF)的推广,其中文字被替换为文字的 XOR。作为首个理论结果,我们证明每个 CNF 公式都与一个 2-XNF 公式等可满足,即该 XNF 公式中的每个子句至多包含两个文字的 XOR。随后,我们提出一种算法,可将布尔多项式从其代数范式(ANF)高效转换为 2-XNF 公式。使用密码 ASCON-128 的实验表明,就设计而言强依赖 XOR 运算的密码学问题,用 2-XNF 表示时所需的变量和子句远少于 CNF。为利用这种紧凑表示,需要设计基于 2-XNF 输入公式的新型 SAT 求解器。受基于图的 2-CNF SAT 求解启发,我们设计了一种新的基于 DPLL 的 2-XNF 公式 SAT 求解器。除其他内容外,我们提出了先进的预处理和处理中技术。最后,我们给出了随机 2-XNF 实例以及与 ASCON-128 轮数归约版本密钥恢复攻击相关实例的计时结果,在这些实例中,我们的求解器优于最先进的替代求解方法。

英文摘要:

This paper introduces the XOR-OR-AND normal form (XNF) for logical formulas. It is a generalization of the well-known Conjunctive Normal Form (CNF) where literals are replaced by XORs of literals. As a first theoretic result, we show that every CNF formula is equisatisfiable to a formula in 2-XNF, i.e., a formula in XNF where each clause involves at most two XORs of literals. Subsequently, we present an algorithm which converts Boolean polynomials efficiently from their Algebraic Normal Form (ANF) to formulas in 2-XNF. Experiments with the cipher ASCON-128 show that cryptographic problems, which by design are based strongly on XOR-operations, can be represented using far fewer variables and clauses in 2-XNF than in CNF. In order to take advantage of this compact representation, new SAT solvers based on input formulas in 2-XNF need to be designed. By taking inspiration from graph-based 2-CNF SAT solving, we devise a new DPLL-based SAT solver for formulas in 2-XNF. Among others, we present advanced pre- and in-processing techniques. Finally, we give timings for random 2-XNF instances and instances related to key recovery attacks on round reduced ASCON-128, where our solver outperforms state-of-the-art alternative solving approaches.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑