Constructing and Counting Even-Variable Symmetric Boolean Functions with Algebraic Immunity not Less Than $d$

Details Constructing and Counting Even-Variable Symmetric Boolean Functions with Algebraic Immunity not Less Than $d$ Constructing and Counting Even-Variable Symmetric Boolean Functions with Algebraic Immunity not Less Than $d$

2011-10-18

arxiv.org/abs/1110.3875v1

Computer Science

Cryptography and Security

Scientific paper

In this paper, we explicitly construct a large class of symmetric Boolean functions on $2k$ variables with algebraic immunity not less than $d$, where integer $k$ is given arbitrarily and $d$ is a given suffix of $k$ in binary representation. If let $d = k$, our constructed functions achieve the maximum algebraic immunity. Remarkably, $2^{\lfloor \log_2{k} \rfloor + 2}$ symmetric Boolean functions on $2k$ variables with maximum algebraic immunity are constructed, which is much more than the previous constructions. Based on our construction, a lower bound of symmetric Boolean functions with algebraic immunity not less than $d$ is derived, which is $2^{\lfloor \log_2{d} \rfloor + 2(k-d+1)}$. As far as we know, this is the first lower bound of this kind.

Affiliated with

Also associated with

No associations

Rating

Constructing and Counting Even-Variable Symmetric Boolean Functions with Algebraic Immunity not Less Than $d$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Constructing and Counting Even-Variable Symmetric Boolean Functions with Algebraic Immunity not Less Than $d$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constructing and Counting Even-Variable Symmetric Boolean Functions with Algebraic Immunity not Less Than $d$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-289933