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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of systems science and complexity Ročník 38; číslo 4; s. 1784 - 1802
Hlavní autoři:	Hu, Xiaobo, Xu, Shengyuan, Tu, Yinzi, Feng, Xiutao, Zhang, Weihan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2025 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!