A Note on "On the Construction of Boolean Functions with Optimal Algebraic Immunity"

preprint2012arXivOpen access

Abstract

In this note, we go further on the "basis exchange" idea presented in \cite{LiNa1} by using Mobious inversion. We show that the matrix S1(f)S0(f)−1S_1(f)S_0(f)^{-1} has a nice form when ff is chosen to be the majority function, where S1(f)S_1(f) is the matrix with row vectors υk(α)\upsilon_k(α) for all α∈1fα\in 1_f and S0(f)=S1(f⊕1)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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.