Enumerating Boolean functions of cryptographic significance
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4179290 (Why is no real title available?)
- scientific article; zbMATH DE number 3943824 (Why is no real title available?)
- scientific article; zbMATH DE number 3970672 (Why is no real title available?)
- scientific article; zbMATH DE number 4033662 (Why is no real title available?)
- scientific article; zbMATH DE number 3792089 (Why is no real title available?)
- scientific article; zbMATH DE number 16477 (Why is no real title available?)
- scientific article; zbMATH DE number 67085 (Why is no real title available?)
- scientific article; zbMATH DE number 3069874 (Why is no real title available?)
- Analysis and design of stream ciphers
- Balance, uncorrelatedness and the strict avalanche criterion
- Communication Theory of Secrecy Systems*
- Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
- Dependence of output on input in DES: small avalanche characteristics
- On the cryptanalysis of rotor machines and substitution - permutation networks
- Propagation Characteristics of the DES
- Structured Design of Substitution-Permutation Encryption Networks
- The Asymptotic Number of Latin Rectangles
- Theory of permanents 1978–1981
Cited in
(34)- Balancedness and Correlation Immunity of Symmetric Boolean Functions
- On the enumeration of bipartite simple games
- An iterative method for linear decomposition of index generating functions
- Certificate complexity and symmetry of nested canalizing functions
- THE INCLUSION-EXCLUSION PRINCIPLE AND ITS APPLICATIONS TO CRYPTOGRAPHY
- Information encryption systems based on Boolean functions
- Linear structures of symmetric functions over finite fields
- Improving bounds for the number of correlation immune Boolean functions
- Algebraic nonlinearity and its applications to cryptography
- Generalized lexicographic multiobjective combinatorial optimization. Application to cryptography
- Value distribution of elementary symmetric polynomials and its perturbations over finite fields
- Asymptotic enumeration of correlation-immune Boolean functions
- Correlation immunity and resiliency of symmetric Boolean functions
- Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications
- Hamming weights of symmetric Boolean functions
- \(k\)th order symmetric SAC Boolean functions and bisecting binomial coefficients
- Balancedness and correlation immunity of symmetric Boolean functions
- Sensitivities and block sensitivities of elementary symmetric Boolean functions
- Further enumerating Boolean functions of cryptographic significance
- Improved lower bound on the number of balanced symmetric functions over \(\text{GF}(p)\)
- A variation on bisecting the binomial coefficients
- Resistance of balanced s-boxes to linear and differential cryptanalysis
- Automata, Languages and Programming
- Symmetric random function generator (SRFG): a novel cryptographic primitive for designing fast and robust algorithms
- Bisecting binomial coefficients
- scientific article; zbMATH DE number 1107684 (Why is no real title available?)
- Certificate complexity of elementary symmetric Boolean functions
- Modular periodicity of exponential sums of symmetric Boolean functions
- Closed formulas for exponential sums of symmetric polynomials over Galois fields
- Enumerative encoding of correlation-immune Boolean functions
- On the independence of Boolean functions
- Nondegenerate functions and permutations
- scientific article; zbMATH DE number 7674552 (Why is no real title available?)
- Generalized exponential sums and the power of computers
This page was built for publication: Enumerating Boolean functions of cryptographic significance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q918500)
