XOR Local Search for Boolean Brent Equations

Nawrocki, Wojciech; Liu, Zhenjun; Fröhlich, Andreas; Heule, Marijn J. H.; Biere, Armin

doi:10.1007/978-3-030-80223-3_29

Theory and Applications of Satisfiability Testing – SAT 2021

2021

DOI: 10.1007/978-3-030-80223-3_29

|View full text |Cite

XOR Local Search for Boolean Brent Equations

Wojciech Nawrocki

Zhenjun Liu

Andreas Fröhlich

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

SAT Solving Using XOR-OR-AND Normal Forms

Andraschko,

Danner,

Kreuzer

2024

Math.Comput.Sci.

View full text Add to dashboard Cite

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.

show abstract

SAT Solving Using XOR-OR-AND Normal Forms

Andraschko,

Danner,

Kreuzer

2024

Math.Comput.Sci.

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

XOR Local Search for Boolean Brent Equations

Cited by 1 publication

References 30 publications

SAT Solving Using XOR-OR-AND Normal Forms

SAT Solving Using XOR-OR-AND Normal Forms

Contact Info

Product

Resources

About