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

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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of systems science and complexity Jg. 38; H. 4; S. 1784 - 1802
Hauptverfasser:	Hu, Xiaobo, Xu, Shengyuan, Tu, Yinzi, Feng, Xiutao, Zhang, Weihan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2025 Springer Nature B.V
Schlagworte:	Algorithms Approximation Boolean Canonical forms Complex Systems Control Cryptography Linear programming Mathematics Mathematics and Statistics Mathematics of Computing Methods Operations Research/Decision Theory R&D Research & development Search methods Software Statistics Systems science Systems Theory Boolean satisfiability problem Automatic cryptanalysis full CNF characterization
ISSN:	1009-6124, 1559-7067
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!