Highly Nonlinear Balanced Boolean Functions with Very Good Autocorrelation Property

Abstract Constructing highly nonlinear balanced Boolean functions with very good autocorrelation property is an interesting open question. In this direction we use the measure Δ f , the highest magnitude of all autocorrelation coefficients for a function f . We provide balanced functions f with currently best known nonlinearity and Δ f values together. Our results for 15-variable functions disprove the conjecture proposed by Zhang and Zheng (1995) for different ranges of nonlinearity, where our constructions are based on modifications of Patterson-Wiedemann (1983) functions. Also we propose a simple bent based construction technique to get functions with very good Δ f values for odd number of variables. This construction has a root in Kerdock Codes. Moreover, our construction on even number of variables is a recursive one and we conjecture (similar to Dobbertin's conjecture (1994) with respect to nonlinearity) that this provides the minimum possible value of Δ f for a balanced function f on even number of variables.

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

[2]  Yuliang Zheng,et al.  GAC - the Criterion for Global Avalance Characteristics of Cryptographic Functions , 1995, J. Univers. Comput. Sci..

[3]  Stafford E. Tavares,et al.  On the Design of S-Boxes , 1985, CRYPTO.

[4]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[5]  Claude Carlet,et al.  A Characterization of Binary Bent Functions , 1996, J. Comb. Theory, Ser. A.

[6]  Jennifer Seberry,et al.  Nonlinearly Balanced Boolean Functions and Their Propagation Characteristics (Extended Abstract) , 1993, CRYPTO.

[7]  Nicholas J. Patterson,et al.  The covering radius of the (215, 16) Reed-Muller code is at least 16276 , 1983, IEEE Trans. Inf. Theory.

[8]  Willi Meier,et al.  Nonlinearity Criteria for Cryptographic Functions , 1990, EUROCRYPT.

[9]  Palash Sarkar,et al.  Construction of Nonlinear Boolean Functions with Important Cryptographic Properties , 2000, EUROCRYPT.

[10]  Joos Vandewalle,et al.  Propagation Characteristics of Boolean Functions , 1991, EUROCRYPT.

[11]  Claude Carlet,et al.  A characterization of binary bent functions , 1997, Proceedings of IEEE International Symposium on Information Theory.

[12]  Hans Dobbertin,et al.  Construction of Bent Functions and Balanced Boolean Functions with High Nonlinearity , 1994, FSE.

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

[14]  Cunsheng Ding,et al.  The Stability Theory of Stream Ciphers , 1991, Lecture Notes in Computer Science.

[15]  O. S. Rothaus,et al.  On "Bent" Functions , 1976, J. Comb. Theory, Ser. A.

[16]  Choonsik Park,et al.  Global Avalanche Characteristics and Propagation Criterion of Balanced Boolean Functions , 1999, Inf. Process. Lett..

[17]  Palash Sarkar,et al.  Modifications of Patterson-Wiedemann functions for cryptographic applications , 2002, IEEE Trans. Inf. Theory.