The Nonlinearity Lower Bounds on the Second Order of Cubic Monomial Boolean Functions
Yiqi Fang
Abstract
Yiqi Fang
Abstract
This paper investigates cubic monomial Boolean functions fμ(x)=Tr(μxd) with n variables,where d=2i+2j+1,μ∈GF(2n)*,and nij.The known results show that the Boolean functions fμ(x) has good lower bounds on the second nonlinearity for n2i.This paper firstly studies all lower bounds on the nonlinearity of the derivatives of fμ(x),then the lower bounds on the second order nonlinearity of fμ(x) for n≤2i are given.The results show that the lower bounds on the second order nonlinearity of fμ(x) for n≤2i are tighter than that of fμ(x) for n2i.Therefore,whether n2i or n≤2i,the Boolean functions fμ(x) can resist quadratic or linear approximation attacks.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper investigates cubic monomial Boolean functions fμ(x)=Tr(μxd) with n variables,where d=2i+2j+1,μ∈GF(2n)*,and nij.The known results show that the Boolean functions fμ(x) has good lower bounds on the second nonlinearity for n2i.This paper firstly studies all lower bounds on the nonlinearity of the derivatives of fμ(x),then the lower bounds on the second order nonlinearity of fμ(x) for n≤2i are given.The results show that the lower bounds on the second order nonlinearity of fμ(x) for n≤2i are tighter than that of fμ(x) for n2i.Therefore,whether n2i or n≤2i,the Boolean functions fμ(x) can resist quadratic or linear approximation attacks.
Key concepts: Monomial, Boolean function, Mathematics, Quadratic equation, Order (exchange), Combinatorics, Nonlinear system, Discrete mathematics