Construction of nonlinear resilient Boolean functions using "small" affine functions

In this correspondence, we use affine functions on a small number of variables to construct resilient functions on a large number of variables. We show that by properly combining these functions it is possible to achieve high nonlinearity and high algebraic degree. An important contribution of the correspondence is to show that for each order of resiliency m, it is possible to find infinitely many odd and even positive integers n, such that it is possible to construct (maximum degree) n-variable, m-resilient functions having nonlinearity strictly greater than 2/sup n-1/-2/sup /spl lfloor/n/2/spl rfloor//. We also present construction of some important functions on a small number of variables.

[1]  Yuriy Tarannikov,et al.  On the Constructing of Highly Nonlinear Resilient Boolean Functions by Means of Special Matrices , 2001, INDOCRYPT.

[2]  Palash Sarkar,et al.  Maximum nonlinearity of symmetric Boolean functions on odd number of variables , 2002, IEEE Trans. Inf. Theory.

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

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

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

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

[7]  P. Sarkar,et al.  Improved construction of nonlinear resilient S-boxes , 2002, IEEE Transactions on Information Theory.

[8]  Palash Sarkar,et al.  New Constructions of Resilent and Correlation Immune Boolean Functions achieving Upper Bounds on Nonlinearity , 2000, IACR Cryptol. ePrint Arch..

[9]  Sangjin Lee,et al.  On the Correlation Immune Functions and Their Nonlinearity , 1996, ASIACRYPT.

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

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

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

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

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

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

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

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

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

[19]  Claude Carlet,et al.  On Correlation-Immune Functions , 1991, CRYPTO.

[20]  Claude Carlet,et al.  A Larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction , 2002, CRYPTO.

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