%0 Journal Article
%T On Third-Order Nonlinearity of Biquadratic Monomial Boolean Functions
%A Brajesh Kumar Singh
%J International Journal of Engineering Mathematics
%D 2014
%R 10.1155/2014/937386
%X The th-order nonlinearity of Boolean function plays a central role against several known attacks on stream and block ciphers. Because of the fact that its maximum equals the covering radius of the th-order Reed-Muller code, it also plays an important role in coding theory. The computation of exact value or high lower bound on the th-order nonlinearity of a Boolean function is very complicated problem, especially when . This paper is concerned with the computation of the lower bounds for third-order nonlinearities of two classes of Boolean functions of the form for all , , where , where , , and are integers such that and , and , where is a positive integer such that and . 1. Introduction Boolean functions are the building blocks for the design and the security of symmetric cryptographic systems and for the definition of some kinds of error correcting codes, sequences, and designs. The th-order nonlinearity, , of a Boolean function is defined by the minimum Hamming distance of to -Reed-Muller code of length and order . The nonlinearity of is given by and is related to the immunity of against best affine approximation attacks [1] and fast correlation attacks [2], when is used as a combiner function or a filter function in a stream cipher. The th-order nonlinearity is an important parameter, which measures the resistance of the function against various low-order approximation attacks [1, 3, 4]. In cryptographic framework, within a trade-off with the other important criteria, the th-order nonlinearity must be as large as possible; see [5¨C9]. Since, the maximal th-order nonlinearity of all Boolean functions equals the covering radius of , it also has an application in coding theory. Besides these applications, an interesting connection between the th-order nonlinearity and the fast algebraic attacks has been introduced, recently in [9], which claims that a cryptographic Boolean function should have high th-order nonlinearity to resist the fast algebraic attack. Unlike nonlinearity there is no efficient algorithm to compute second-order nonlinearities for . The most efficient algorithm is introduced by Fourquet and Tavernier [10] which works for and up to for some special functions. Thus, to identify a class of Boolean function with high th-order nonlinearity, even for , is a very relevant area of research. In 2008, Carlet has devolved a technique to compute th-order nonlinearity recursively in [11], and using this technique he has obtained the lower bounds of nonlinearity profiles for functions belonging to several classes of functions: Kasami functions,
%U http://www.hindawi.com/journals/ijem/2014/937386/