Abstract
The main construction for resilient functions uses linear errorcorrecting codes; a resilient function constructed in this way is said to be linear. It has been conjectured that if a resilient function exists, then a linear function with the same parameters exists. In this note we construct infinite classes of nonlinear resilient functions from the Kerdock and Preparata codes. We also show that linear resilient functions having the same parameters as the functions that we construct from the Kerdock codes do not exist. Thus, the aforementioned conjecture is disproved.k
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
C. H. Bennett, G. Brassard, and J.-M. Robert. Privacy amplification by public discussion. SIAM J. Comput. 17 (1988), 210–229.
E. R. Berlekamp. Algebraic Coding Theory, Aegean Park Press, Laguna Hills, CA, 1984.
A. E. Brouwer and L. M. G. M. Tolhuizen. A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters. Designs Codes Cryptography 3 (1993), 95–98.
B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich, and R. Smolensky. The bit extraction problem or t-resilient functions. Proc. 26th IEEE Symp. on Foundations of Computer Science, 1985, pp. 396–407.
P. Delsarte. An Algebraic Approach to the Association Schemes of Coding Theory. Philips Research Reports Supplements, vol. 10, 1973.
J.-M. Goethals and S. L. Snover. Nearly perfect binary codes. Discrete Math. 3 (1972), 65–88.
K. Gopalakrishnan and D. R. Stinson. Three characterizations of non-binary correlationimmune and resilient functions. Designs Codes Cryptography, to appear.
A. M. Kerdock. A class of low rate non-linear codes. Inform. and Control 20 (1972), 182–187.
F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
U. M. Maurer and J. L. Massey. Local randomness in pseudorandom sequences. J. Cryptology b (1991), 135–149.
F. P. Preparata. A class of optimum non-linear double-error-correcting codes. Inform. and Control 13 (1968), 378–400.
D. R. Stinson. Resilient functions and large sets of orthogonal arrays. Congr. Numer. 92 (1993), 105–110.
T. Verhoeff. An updated table of minimum-distance bounds for binary linear codes. IEEE Trans. Inform. Theory 33 (1987), 665–680.
Author information
Authors and Affiliations
Additional information
Communicated by Gilles Brassard
Research supported by NSF Grant CCR-9121051.
Rights and permissions
About this article
Cite this article
Stinson, D.R., Massey, J.L. An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions. J. Cryptology 8, 167–173 (1995). https://doi.org/10.1007/BF00202271
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00202271