kth order symmetric SAC Boolean functions and bisecting binomial coefficients
From MaRDI portal
Publication:2387429
Recommendations
Cites work
- scientific article; zbMATH DE number 4179290 (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 1394321 (Why is no real title available?)
- A note on a conjecture concerning symmetric resilient functions
- Counting binary functions with certain cryptographic properties
- Enumerating Boolean functions of cryptographic significance
- Maximum nonlinearity of symmetric Boolean functions on odd number of variables
- On the bent Boolean functions that are symmetric
Cited in
(12)- Asymptotic behavior of perturbations of symmetric functions
- Certificate complexity and symmetry of nested canalizing functions
- Generalized Walsh transforms of symmetric and rotation symmetric Boolean functions are linear recurrent
- Linear structures of symmetric functions over finite fields
- Strict avalanche criterion over finite fields
- Exploring confusion in product ciphers through regression analysis
- Short \(k\)-rotation symmetric Boolean functions
- A variation on bisecting the binomial coefficients
- Walsh-Hadamard transforms of generalized \(p\)-ary functions and \(C\)-finite sequences
- Bisecting binomial coefficients
- Modular periodicity of exponential sums of symmetric Boolean functions
- Generalized exponential sums and the power of computers
This page was built for publication: \(k\)th order symmetric SAC Boolean functions and bisecting binomial coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2387429)