On Nonlinearity of S‐Boxes and Their Related Binary Codes

Abstract

The nonlinearity of S-boxes and their related supercodes of the first order Reed-Muller code are discussed. Based on the properties of multi-output bent functions and almost bent functions, we determine the maximum size of linear supercodes of the first order Reed-Muller code which have optimal or suboptimal minimum distance, and we also give the weight distributions of these supercodes which achieve the best possible size. Furthermore, an upper bound on the minimum distance of a class of binary linear codes is presented, which yields a new upper bound on the nonlinearity of S-boxes. The new bound on nonlinearity improves a bound given by Carlet et al. in 2007.