Search for Boolean Functions With Excellent Profiles in the Rotation Symmetric Class

For the first time Boolean functions on 9 variables having nonlinearity 241 are discovered, that remained as an open question in literature for almost three decades. Such functions are found by heuristic search in the space of rotation symmetric Boolean functions (RSBFs). This shows that there exist Boolean functions on n (odd) variables having nonlinearity >2n-1-2n-1/2 if and only if n>7. Using similar search technique, balanced Boolean functions on 9, 10, and 11 variables are attained having autocorrelation spectra with maximum absolute value <2lceiln/2rceil. On odd number of variables, earlier such functions were known for 15, 21 variables; there was no evidence of such functions at all on even number of variables. In certain cases, our functions can be affinely transformed to obtain first-order resiliency or first-order propagation characteristics. Moreover, 10 variable functions having first-order resiliency and nonlinearity 492 are presented that had been posed as an open question at Crypto 2000. The functions reported in this paper are discovered using a suitably modified steepest descent based iterative heuristic search in the RSBF class along with proper affine transformations. It seems elusive to get a construction technique to match such functions

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

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

[3]  Amr M. Youssef,et al.  On the existence of (9,3,5,240) resilient functions , 2006, IEEE Transactions on Information Theory.

[4]  Eric Filiol,et al.  Highly Nonlinear Balanced Boolean Functions with a Good Correlation-Immunity , 1998, EUROCRYPT.

[5]  Susan Stepney,et al.  Evolving Boolean Functions Satisfying Multiple Criteria , 2002, INDOCRYPT.

[6]  William Millan,et al.  An effective genetic algorithm for finding highly nonlinear Boolean Functions , 1997, ICICS.

[7]  John A. Clark,et al.  Results on Rotation Symmetric Bent and Correlation Immune Boolean Functions , 2004, FSE.

[8]  Alexander Maximov,et al.  Classes of Plateaued Rotation Symmetric Boolean Functions under Transformation of Walsh Spectra , 2004, IACR Cryptol. ePrint Arch..

[9]  Pantelimon Stanica,et al.  Fast evaluation, weights and nonlinearity of rotation-symmetric functions , 2002, Discret. Math..

[10]  Johannes Mykkeltveit The covering radius of the (128, 8) Reed-Muller code is 56 (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[11]  Sugata Gangopadhyay,et al.  Patterson-Wiedemann construction revisited , 2006, Discret. Math..

[12]  Palash Sarkar,et al.  New Constructions of Resilient and Correlation Immune Boolean Functions Achieving Upper Bound on Nonlinearity , 2001, Electron. Notes Discret. Math..

[13]  Enes Pasalic,et al.  Further Results on the Relation Between Nonlinearity and Resiliency for Boolean Functions , 1999, IMACC.

[14]  Timo Neumann,et al.  BENT FUNCTIONS , 2006 .

[15]  Subhamoy Maitra Highly Nonlinear Balanced Boolean Functions with Very Good Autocorrelation Property , 2001, Electron. Notes Discret. Math..

[16]  John A. Clark,et al.  Almost Boolean Functions: The Design of Boolean Functions by Spectral Inversion , 2004, Comput. Intell..

[17]  Subhamoy Maitra,et al.  Further constructions of resilient Boolean functions with very high nonlinearity , 2002, IEEE Trans. Inf. Theory.

[18]  Josef Pieprzyk,et al.  Rotation-Symmetric Functions and Fast Hashing , 1998, J. Univers. Comput. Sci..

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

[20]  William Millan,et al.  Boolean Function Design Using Hill Climbing Methods , 1999, ACISP.

[21]  Caroline Fontaine,et al.  On Some Cosets of the First-Order Reed-Muller Code with High Minimum Weight , 1999, IEEE Trans. Inf. Theory.

[22]  John A. Clark,et al.  Two-Stage Optimisation in the Design of Boolean Functions , 2000, ACISP.

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

[24]  Palash Sarkar,et al.  Cryptographically significant Boolean functions with five valued Walsh spectra , 2002, Theor. Comput. Sci..

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

[26]  Josef Pieprzyk,et al.  Fast Hashing and Rotation-Symmetric Functions , 1999 .

[27]  Amr M. Youssef,et al.  On the Existence of Resilient Functions , 2006 .

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

[29]  Claude Carlet,et al.  Propagation Characteristics of Boolean Functions , 2005, Encyclopedia of Cryptography and Security.

[30]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[31]  Pantelimon Stanica,et al.  Rotation Symmetric Boolean Functions -; Count and Cryptographic Properties , 2003, Electron. Notes Discret. Math..

[32]  Pantelimon Stanica,et al.  A constructive count of rotation symmetric functions , 2003, Inf. Process. Lett..

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

[34]  William Millan,et al.  Heuristic Design of Cryptographically Strong Balanced Boolean Functions , 1998, EUROCRYPT.

[35]  Elwyn R. Berlekamp,et al.  Weight distributions of the cosets of the (32, 6) Reed-Muller code , 1972, IEEE Trans. Inf. Theory.

[36]  Martin Hell,et al.  Plateaued Rotation Symmetric Boolean Functions on Odd Number of Variables , 2004, IACR Cryptol. ePrint Arch..

[37]  A. Maximov,et al.  On Efficient Implementation of a Search Strategy for Rotation Symmetric Boolean Functions , 2004 .

[38]  Subhamoy Maitra,et al.  Results on Algebraic Immunity for Cryptographically Significant Boolean Functions , 2004, INDOCRYPT.

[39]  J. Dillon Elementary Hadamard Difference Sets , 1974 .

[40]  Selçuk Kavut,et al.  Enumeration of 9-Variable Rotation Symmetric Boolean Functions Having Nonlinearity > 240 , 2006, INDOCRYPT.

[41]  Selçuk Kavut,et al.  Improved Cost Function in the Design of Boolean Functions Satisfying Multiple Criteria , 2003, INDOCRYPT.