CDCL(⊕) generalizes CDCL to XNF formulas with linear clauses, polynomially simulates Res(⊕), and is implemented in Xorcle which outperforms standard solvers on selected XNF benchmarks.
Bard, Algebraic Cryptanalysis, Springer US, Boston, MA
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Genetic algorithm with Walsh-Hadamard Spectrum cost function generates 8x8 S-boxes with nonlinearity 104 in average 49,399 iterations at 100% success rate, matching best-known methods.
citing papers explorer
-
Extending CDCL to disjunctions of parity equations
CDCL(⊕) generalizes CDCL to XNF formulas with linear clauses, polynomially simulates Res(⊕), and is implemented in Xorcle which outperforms standard solvers on selected XNF benchmarks.
-
Evolutionary Approach to S-box Generation: Optimizing Nonlinear Substitutions in Symmetric Ciphers
Genetic algorithm with Walsh-Hadamard Spectrum cost function generates 8x8 S-boxes with nonlinearity 104 in average 49,399 iterations at 100% success rate, matching best-known methods.