Computer Science – Cryptography and Security
Scientific paper
2011-10-18
Computer Science
Cryptography and Security
Scientific paper
In this note, we go further on the "basis exchange" idea presented in \cite{LiNa1} by using Mobious inversion. We show that the matrix $S_1(f)S_0(f)^{-1}$ has a nice form when $f$ is chosen to be the majority function, where $S_1(f)$ is the matrix with row vectors $\upsilon_k(\alpha)$ for all $\alpha \in 1_f$ and $S_0(f)=S_1(f\oplus1)$. And an exact counting for Boolean functions with maximum algebraic immunity by exchanging one point in on-set with one point in off-set of the majority function is given. Furthermore, we present a necessary condition according to weight distribution for Boolean functions to achieve algebraic immunity not less than a given number.
Kan Haibin
Kokichi Futatsugi
Li Yuan
No associations
LandOfFree
A Note on "On the Construction of Boolean Functions with Optimal Algebraic Immunity" 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 A Note on "On the Construction of Boolean Functions with Optimal Algebraic Immunity", we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on "On the Construction of Boolean Functions with Optimal Algebraic Immunity" will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-290060