On $2k$-Variable Symmetric Boolean Functions with Maximum Algebraic Immunity $k$

Details On $2k$-Variable Symmetric Boolean Functions with Maximum Algebraic Immunity $k$ On $2k$-Variable Symmetric Boolean Functions with Maximum Algebraic Immunity $k$

2011-11-09

arxiv.org/abs/1111.2121v2

Computer Science

Cryptography and Security

Scientific paper

Algebraic immunity of Boolean function $f$ is defined as the minimal degree of a nonzero $g$ such that $fg=0$ or $(f+1)g=0$. Given a positive even integer $n$, it is found that the weight distribution of any $n$-variable symmetric Boolean function with maximum algebraic immunity $\frac{n}{2}$ is determined by the binary expansion of $n$. Based on the foregoing, all $n$-variable symmetric Boolean functions with maximum algebraic immunity are constructed. The amount is $(2\wt(n)+1)2^{\lfloor \log_2 n \rfloor}$

Affiliated with

Also associated with

No associations

Rating

On $2k$-Variable Symmetric Boolean Functions with Maximum Algebraic Immunity $k$ 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 On $2k$-Variable Symmetric Boolean Functions with Maximum Algebraic Immunity $k$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On $2k$-Variable Symmetric Boolean Functions with Maximum Algebraic Immunity $k$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-41716