No article text was recorded for this version.
combinatorial search space explosion (exponential search space complexity)
Version 2 of 238 papers49 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Degree is Important: On Evolving Homogeneous Boolean Functions
- Blog: Results on Rotation Symmetric Bent Functions
- Blog: A New Pairwise NPN Boolean Matching Algorithm Based on Structural Difference Signature
- Blog: The Resistance of PRESENT-80 Against Related-Key Differential Attacks
- Blog: Discovering Rotation Symmetric Self-dual Bent Functions with Evolutionary Algorithms
- Blog: Minimum Distance between Bent and 1-resilient Boolean Functions
- Blog: Look into the Mirror: Evolving Self-dual Bent Boolean Functions
- Blog: Rebound Attack on the Full Lane Compression Function
- Blog: Construction of n-variable (n ≡ 2 mod 4) balanced Boolean functions with maximum absolute value in autocorrelation spectra < 2n/2
- Blog: Digging Deeper: Operator Analysis for Optimizing Nonlinearity of Boolean Functions
- Blog: A characterisation of S-box fitness landscapes in cryptography
- Blog: Cellular Automata Based S-boxes
- Blog: A survey of metaheuristic algorithms for the design of cryptographic Boolean functions
- Blog: Evolutionary Construction of Perfectly Balanced Boolean Functions
- Blog: An efficient NPN Boolean matching algorithm based on structural signature and Shannon expansion
- Blog: Enhanced Fast Boolean Matching based on Sensitivity Signatures Pruning
- Blog: The More the Merrier: On Evolving Five-Valued Spectra Boolean Functions
- Blog: Which Boolean Functions are Most Informative?
- Blog: Automatic Search for Related-Key Differential Characteristics in Byte-Oriented Block Ciphers: Application to AES, Camellia, Khazad and Others
- Blog: A Canonical-based NPN Boolean Matching Algorithm Utilizing Boolean Difference and Cofactor Signature
- Blog: On the Evolution of Boomerang Uniformity in Cryptographic S-boxes
- Blog: On Cryptographic Attacks Using Backdoors for SAT
- Blog: Security in Outsourcing of Association Rule Mining
- Blog: There exist Boolean functions on n (odd) variables having nonlinearity > 2n-1 - 2(n-1)/2 if and only if n>7
- Blog: On the Evolution of Boolean Functions with the Algebraic Normal Form Representation
- Blog: Higher Order Side-Channel Attacks Resilient S-boxes
- Blog: TroLL: Exploiting Structural Similarities between Logic Locking and Hardware Trojans
- Blog: Fast Exact NPN Classification with Influence-aided Canonical Form
- Blog: Idempotents in the Neighbourhood of Patterson-Wiedemann Functions having Walsh Spectra Zeros
- Blog: Patterson-Wiedemann type functions on 21 variables with Nonlinearity greater than Bent Concatenation bound
- Blog: A New Angle: On Evolving Rotation Symmetric Boolean Functions
- Blog: Counterexample to Majority Optimality in NICD with Erasures
- Blog: On the exponents of APN power functions and Sidon sets, sum-free sets, and Dickson polynomials
- Blog: A Systematic Study on the Design of Odd-Sized Highly Nonlinear Boolean Functions via Evolutionary Algorithms
- Blog: A Systematic Evaluation of Evolving Highly Nonlinear Boolean Functions in Odd Sizes
- Blog: Boolean Functions, Projection Operators, and Quantum Error Correcting Codes
- Blog: Evolving Constructions for Balanced, Highly Nonlinear Boolean Functions
- Blog: Rethinking NPN Classification from Face and Point Characteristics of Boolean Functions
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_combinatorial_search_space_explosion_exp_bd6e657f,
title = {combinatorial search space explosion (exponential search space complexity)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/combinatorial-search-space-explosion-exponential-search-space-complexity/rdr_bd6e657f08ab49878c47301e033cbc7e},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_combinatorial_search_space_explosion_exp_bd6e657f_v2,
title = {combinatorial search space explosion (exponential search space complexity)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/combinatorial-search-space-explosion-exponential-search-space-complexity/rdr_bd6e657f08ab49878c47301e033cbc7e/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}