On the lower bounds of the second order nonlinearities of some Boolean functions

Abstract

The rth order nonlinearity of a Boolean function is an important cryptographic criterion in analyzing the security of stream as well as block ciphers. It is also important in coding theory as it is related to the covering radius of the Reed-Muller code R (r, n). In this paper we deduce the lower bounds of the second order nonlinearities of the following two types of Boolean functions:. 1.f? (x) = Tr1n (? xd) with d = 22 r + 2r + 1 and ? ? F2n*, where n = 6 r.2.f (x, y) = Tr1t (xy2i + 1), where x, y ? F2t, n = 2 t, n ? 6 and i is an integer such that 1 ? i < t, gcd (2t - 1, 2i + 1) = 1. For some ?, the functions of the first type are bent functions, whereas Boolean functions of the second type are all bent functions, i.e., they possess the maximum first order nonlinearity. It is demonstrated that in some cases our bounds are better than the previously obtained bounds. © 2009 Elsevier Inc. All rights reserved.