CNF Characterization of Sets over ℤ2n and Its Applications in Cryptography

• Published in: Journal of systems science and complexity Vol. 38; no. 4; pp. 1784 - 1802
• Main Authors: Hu, Xiaobo, Xu, Shengyuan, Tu, Yinzi, Feng, Xiutao, Zhang, Weihan
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2025; Springer Nature B.V
• Subjects: Algorithms; Approximation; Canonical forms; Complex Systems; Control; Cryptography; Mathematics; Mathematics and Statistics; Mathematics of Computing; Operations Research/Decision Theory; Search methods; Statistics; Systems Theory; Boolean satisfiability problem; Automatic cryptanalysis; full CNF characterization

In recent years, automatic search has been widely used to search differential characteristics and linear approximations with high probability/correlation in symmetric-key cryptanalyses. Among these methods, the automatic search with the Boolean satisfiability problem (SAT, in short) gradually become...