Improved upper bound on root number of linearized polynomials and its application to nonlinearity estimation of Boolean functions

by   Sihem Mesnager, et al.

To determine the dimension of null space of any given linearized polynomial is one of vital problems in finite field theory, with concern to design of modern symmetric cryptosystems. But, the known general theory for this task is much far from giving the exact dimension when applied to a specific linearized polynomial. The first contribution of this paper is to give a better general method to get more precise upper bound on the root number of any given linearized polynomial. We anticipate this result would be applied as a useful tool in many research branches of finite field and cryptography. Really we apply this result to get tighter estimations of the lower bounds on the second order nonlinearities of general cubic Boolean functions, which has been being an active research problem during the past decade, with many examples showing great improvements. Furthermore, this paper shows that by studying the distribution of radicals of derivatives of a given Boolean functions one can get a better lower bound of the second-order nonlinearity, through an example of the monomial Boolean function g_μ=Tr(μ x^2^2r+2^r+1) over any finite field n.


page 1

page 2

page 3

page 4


On Polytime Algorithm for Factorization of Multilinear Polynomials Over F2

In 2010, A. Shpilka and I. Volkovich established a prominent result on t...

On some cryptographic properties of Boolean functions and their second-order derivatives

In this paper some cryptographic properties of Boolean functions, includ...

On the Degree of Boolean Functions as Polynomials over Z_m

Polynomial representations of Boolean functions over various rings such ...

A tighter bound on the number of relevant variables in a bounded degree Boolean function

A classical theorem of Nisan and Szegedy says that a boolean function wi...

On A Polytime Factorization Algorithm for Multilinear Polynomials Over F2

In 2010, A. Shpilka and I. Volkovich established a prominent result on t...

Computing the Hausdorff Distance of Two Sets from Their Signed Distance Functions

The Hausdorff distance is a measure of (dis-)similarity between two sets...

An Axiomatic Approach to Formalized Responsibility Ascription

Quantified responsibility ascription in complex scenarios is of crucial ...

Please sign up or login with your details

Forgot password? Click here to reset