Autocorrelation Coefficients and Correlation Immunity of Boolean Functions

We apply autocorrelation and Walsh coefficients for the investigation of correlation immune and resilient Boolean functions. We prove new lower bound for the absolute indicator of resilient functions that improves significantly (for m > (n - 3)/2) the bound of Zheng and Zhang [18] on this value. We prove new upper bound for the number of nonlinear variables in high resilient Boolean function. This result supersedes the previous record. We characterize all possible values of resiliency orders for quadratic functions and give a complete description of quadratic Boolean functions that achieve the upper bound on resiliency. We establish new necessary condition that connects the number of variables, the resiliency and the weight of anunbalanced nonconstant correlation immune function and prove that such functions do not exist for m > 0.75n - 1.25. For high orders of m this surprising fact supersedes the well-known Bierbrauer-Friedman bound [8], [1] and was not formulated before even as a conjecture. We improve the upper bound of Zheng and Zhang [18] for the nonlinearity of high order correlation immune unbalanced Boolean functions and establish that for high orders of resiliency the maximum possible nonlinearity for unbalanced correlation immune functions is smaller than for balanced.

[1]  Vladimir I. Levenshtein Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions , 1997, Des. Codes Cryptogr..

[2]  Eyal Kushilevitz,et al.  Exposure-Resilient Functions and All-or-Nothing Transforms , 2000, EUROCRYPT.

[3]  Palash Sarkar,et al.  Nonlinearity Bounds and Constructions of Resilient Boolean Functions , 2000, CRYPTO.

[4]  Yuliang Zheng,et al.  New Results on Correlation Immunity , 2000, ICISC.

[5]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[6]  James L. Massey,et al.  A spectral characterization of correlation-immune combining functions , 1988, IEEE Trans. Inf. Theory.

[7]  Oded Goldreich,et al.  The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[8]  Claude Carlet,et al.  Partially-bent functions , 1992, Des. Codes Cryptogr..

[9]  Thomas Siegenthaler,et al.  Correlation-immunity of nonlinear combining functions for cryptographic applications , 1984, IEEE Trans. Inf. Theory.

[10]  Douglas R. Stinson,et al.  Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds , 1996, SIAM J. Discret. Math..

[11]  Aggelos Kiayias,et al.  Polynomial Reconstruction Based Cryptography , 2001, Selected Areas in Cryptography.

[12]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[13]  Yuriy Tarannikov New Constructions of Resilient Boolean Functions with Maximal Nonlinearity , 2001, FSE.

[14]  Yuliang Zheng,et al.  Improved Upper Bound on the Nonlinearity of High Order Correlation Immune Functions , 2000, Selected Areas in Cryptography.

[15]  Neil J. A. Sloane,et al.  The theory of error-correcting codes (north-holland , 1977 .

[16]  Anne Canteaut,et al.  Propagation Characteristics and Correlation-Immunity of Highly Nonlinear Boolean Functions , 2000, EUROCRYPT.

[17]  Jürgen Bierbrauer,et al.  Bounds on orthogonal arrays and resilient functions , 1995 .

[18]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[19]  Yuriy Tarannikov,et al.  Spectral analysis of high order correlation immune functions , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[20]  Zhen Zhang,et al.  Partial converse for a relay channel , 1988, IEEE Trans. Inf. Theory.

[21]  Joel Friedman,et al.  On the bit extraction problem , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[22]  Yuriy Tarannikov,et al.  On Resilient Boolean Functions with Maximal Possible Nonlinearity , 2000, INDOCRYPT.