Abstract
The paper presents lower and upper bounds on the maximumnonlinearity for an n-input m-output Booleanfunction. We show a systematic construction method for a highlynonlinear Boolean function based on binary linear codes whichcontain the first order Reed-Muller code as a subcode. We alsopresent a method to prove the nonexistence of some nonlinearBoolean functions by using nonexistence results on binary linearcodes. Such construction and nonexistence results can be regardedas lower and upper bounds on the maximum nonlinearity. For somen and m, these bounds are tighter than theconventional bounds. The techniques employed here indicate astrong connection between binary linear codes and nonlinear n-input m-output Boolean functions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
K. Nyberg, Perfect nonlinear S-boxes. In Proc. of EUROCRYPT' 91, Spriger-Verlag (1991) pp. 378–386.
K. Nyberg, Differentially uniform mappings for cryptography. In Proc. of EUROCRYPT' 93, Spriger-Verlag (1993) pp. 55–64.
K. Nyberg, S-boxes and round functions with controllable linearity and differential uniformity, Fast Software Encryption, Leuven 1994, LNCS 1008, Springer-Verlag (1995).
F. Chabaud and S. Vaudenay, Links between differential and linear cryptanalysis. In Proc. of EUROCRYPT' 94, Spriger-Verlag (1994) pp. 356–365.
N. J. Patterson and D. H. Wiedemann, The covering radius of the (215,16) Reed-Muller code is at least 16276, IEEE Trans. Inform. Theory, Vol. IT-29 (1983) pp. 354–356.
M. Matsui, Linear cryptanalysis method for DES cipher. In Proc. of EUROCRYPT'93, Springer-Verlag (1994) pp. 386–397.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes, North-Holland (1977).
G. Cohen, I. Honkala, S. Litsyn, and A. Lobsten, Covering Codes, North-Holland (1997).
T. Kasami and S. Lin, New generalizations of the Reed-Muller codes part I: primitive codes, IEEE Trans. Inform. Theory, Vol. IT-14 (1968) pp. 189–199.
T. Kasami, Weight Distribution of Bose-Chaudhuri-Hocquenghem Codes, in Key papers in the Development of Coding Theory, IEEE Press (1974).
A. E. Brouwer and T. Verhoeff, An updated table of minimum-distance bounds for binary linear codes, IEEE Trans. Inform. Theory, Vol. IT-39 (1993) pp. 662–667. The update version of the paper above is available on line: Bounds on the minimum distance of linear codes, http://www.win.tue.nl/math/dw/ voorlincod.html.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wadayama, T., Hada, T., Wakasugi, K. et al. Upper and Lower Bounds on Maximum Nonlinearity of n-input m-output Boolean Function. Designs, Codes and Cryptography 23, 23–34 (2001). https://doi.org/10.1023/A:1011207501748
Issue Date:
DOI: https://doi.org/10.1023/A:1011207501748