On the Coset Weight Divisibility and Nonlinearity of Resilient and Correlation-Immune Functions

Sarkar and Maitra have recently shown that, given any m-resilient function f on F 2 n , the Hamming distance between f and any affine function on F 2 n is divisible by 2m+1. We show that their result is a simple consequence of a recent characterization of resilient functions by means of their numerical normal forms. This characterization allows us to obtain a better divisibility bound, involving n, m and the algebraic degree d of the function. Smaller is d and/or m, stronger is our improvement. We show that our divisibility bound is tight for every positive n, every non-negative m ≤ n − 2 and every positive d ≤ n − m − 1. We deduce a bound on the nonlinearity of resilient functions involving n, m and d. This bound improves upon those given recently and independently by Sarkar and Maitra and by Tarannikov. We finally show that the same bound stands in the more general framework of m-th order correlation-immune functions, for sufficiently large m.

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

[2]  Palash Sarkar,et al.  Highly Nonlinear Resilient Functions Optimizing Siegenthaler's Inequality , 1999, CRYPTO.

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

[4]  Thomas Johansson,et al.  Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes , 1999, EUROCRYPT.

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

[6]  Anne Canteaut On the weight distributions of optimal cosets of the first-order Reed-Muller codes , 2001, IEEE Trans. Inf. Theory.

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

[8]  Jacques Stern,et al.  Advances in Cryptology — EUROCRYPT ’99 , 1999, Lecture Notes in Computer Science.

[9]  Thomas Johansson,et al.  Fast Correlation Attacks Based on Turbo Code Techniques , 1999, CRYPTO.

[10]  Anne Canteaut,et al.  Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5 , 2000, EUROCRYPT.

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

[12]  Robert J. McEliece,et al.  Weight congruences for p-ary cyclic codes , 1972, Discret. Math..

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

[14]  Claude Carlet,et al.  A New Representation of Boolean Functions , 1999, AAECC.

[15]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

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

[17]  Michael Wiener,et al.  Advances in Cryptology — CRYPTO’ 99 , 1999 .

[18]  Thomas Siegenthaler,et al.  Decrypting a Class of Stream Ciphers Using Ciphertext Only , 1985, IEEE Transactions on Computers.

[19]  Claude Carlet,et al.  Bent, resilient functions and the numerical normal form , 1999, Codes and Association Schemes.

[20]  Claude Carlet,et al.  Two New Classes of Bent Functions , 1994, EUROCRYPT.

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