Enumerating Boolean functions of cryptographic significance

DOI10.1007/BF00190802zbMath0705.94010OpenAlexW2076402408MaRDI QIDQ918500

Chris J. Mitchell

Publication date: 1990

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00190802

zbMATH Keywords

Boolean functionenumeration problemsS-boxesencryption algorithmslook up tables

Mathematics Subject Classification ID

Related Items (27)

Improving bounds for the number of correlation immune Boolean functions ⋮ Correlation immunity and resiliency of symmetric Boolean functions ⋮ Algebraic nonlinearity and its applications to cryptography ⋮ Asymptotic enumeration of correlation-immune Boolean functions ⋮ Resistance of balanced s-boxes to linear and differential cryptanalysis ⋮ Hamming weights of symmetric Boolean functions ⋮ Balancedness and correlation immunity of symmetric Boolean functions ⋮ \(k\)th order symmetric SAC Boolean functions and bisecting binomial coefficients ⋮ Generalized exponential sums and the power of computers ⋮ Enumerative encoding of correlation-immune Boolean functions ⋮ Symmetric random function generator (SRFG): a novel cryptographic primitive for designing fast and robust algorithms ⋮ Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications ⋮ Unnamed Item ⋮ Nondegenerate functions and permutations ⋮ Modular periodicity of exponential sums of symmetric Boolean functions ⋮ On the enumeration of bipartite simple games ⋮ A variation on bisecting the binomial coefficients ⋮ Improved lower bound on the number of balanced symmetric functions over \(\text{GF}(p)\) ⋮ Sensitivities and block sensitivities of elementary symmetric Boolean functions ⋮ Value distribution of elementary symmetric polynomials and its perturbations over finite fields ⋮ Closed formulas for exponential sums of symmetric polynomials over Galois fields ⋮ An iterative method for linear decomposition of index generating functions ⋮ Linear structures of symmetric functions over finite fields ⋮ Certificate complexity of elementary symmetric Boolean functions ⋮ Balancedness and Correlation Immunity of Symmetric Boolean Functions ⋮ Certificate complexity and symmetry of nested canalizing functions ⋮ Bisecting binomial coefficients

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis and design of stream ciphers
• Balance, uncorrelatedness and the strict avalanche criterion
• Dependence of output on input in DES: Small avalanche characteristics
• Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
• Communication Theory of Secrecy Systems*
• Propagation Characteristics of the DES
• Structured Design of Substitution-Permutation Encryption Networks
• On the cryptanalysis of rotor machines and substitution - permutation networks
• Theory of permanents 1978–1981
• The Asymptotic Number of Latin Rectangles

This page was built for publication: Enumerating Boolean functions of cryptographic significance