The strict avalanche criterion: spectral properties of boolean functions and an extended definition
CRYPTO '88 Proceedings on Advances in cryptology
Correlation Immunity and the Summation Generator
CRYPTO '85 Advances in Cryptology
On Correlation-Immune Functions
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Rotation symmetric Boolean functions-Count and cryptographic properties
Discrete Applied Mathematics
Discrete Applied Mathematics - Special issue: Coding and cryptography
Construction of high degree resilient S-boxes with improved nonlinearity
Information Processing Letters
Boolean functions optimizing most of the cryptographic criteria
Discrete Applied Mathematics
Constructions of 1-resilient Boolean functions on odd number of variables with a high nonlinearity
Security and Communication Networks
Spectral Domain Analysis of Correlation Immune and Resilient Boolean Functions
Finite Fields and Their Applications
| Hi-index | 754.84 |
It is shown that a Boolean combining function f(x) of n variables is mth-order correlation-immune if and only if its Walsh transform F(ω) vanishes for all ω with Hamming weight between 1 and m, inclusive. This result is used to extend slightly Siegenthaler's (IEEE Trans. Comput., vol. C-34, pp. 81-85, Jan. 1985) characterization of the algebraic normal form of correlation-immune combining functions