Correlation immunity and resiliency of symmetric Boolean functions

Authors:
Chuan-Kun Wu;Ed Dawson
Affiliations:
State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China;Information Security Research Centre, Queensland University of Technology, G.P.O. Box 2434, Brisbane QLD 4001, Australia
Venue:
Theoretical Computer Science
Year:
2004

Citing 7
Cited 3

Privacy amplification by public discussion

SIAM Journal on Computing - Special issue on cryptography
Enumerating boolean functions of cryptographic significance

Journal of Cryptology
A note on a conjecture concerning symmetric resilient functions

Information Processing Letters
A study of correlation-immune, resilient and related cryptographic functions

A study of correlation-immune, resilient and related cryptographic functions
Bounds for Resilient Functions and Orthogonal Arrays

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Construction of t-resilient functions over a finite alphabet

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
On nonlinear resilient functions

EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques

Linear structures of symmetric functions over finite fields

Information Processing Letters
Linear structures of symmetric functions over finite fields

Information Processing Letters
Enumeration of balanced symmetric functions over GF(p)

Information Processing Letters

Quantified Score

Hi-index	5.23

Visualization

Abstract

Correlation immunity of symmetric Boolean functions is studied in this paper. Lower bounds on the number of constructible correlation immune symmetric functions are given. Constructions for such new balanced functions are presented. These functions are also known as 1-resilient functions. In 1985, Chor et al. conjectured that the only 1-resilient symmetric functions are the exclusive-or of all n variables and its negation. This conjecture, however, was disproved by Gopalakrishnan, Hoffman and Stinson in 1993 by giving a class of infinite counterexamples, and they noted that it does not seem to extend any further in an obvious way. In this paper two more infinite classes of such examples are presented for n being even and being odd, respectively, and consequently one of the two open problems proposed by Gopalakrishnan et al., is addressed by constructing new symmetric resilient functions.