kth order symmetric SAC Boolean functions and bisecting binomial coefficients
From MaRDI portal
Publication:2387429
DOI10.1016/J.DAM.2005.02.006zbMATH Open1072.94023OpenAlexW2003418895MaRDI QIDQ2387429FDOQ2387429
Authors: Yuan Li, Thomas W. Cusick
Publication date: 2 September 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.02.006
Recommendations
Cites Work
- On the bent Boolean functions that are symmetric
- Maximum nonlinearity of symmetric Boolean functions on odd number of variables
- Enumerating Boolean functions of cryptographic significance
- Title not available (Why is that?)
- A note on a conjecture concerning symmetric resilient functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Counting binary functions with certain cryptographic properties
- Title not available (Why is that?)
Cited In (12)
- Certificate complexity and symmetry of nested canalizing functions
- Asymptotic behavior of perturbations of symmetric 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)