Computer Science – Cryptography and Security
Scientific paper
2006-05-30
Computer Science
Cryptography and Security
This paper has been submitted on March 9, 2006
Scientific paper
Algebraic immunity has been proposed as an important property of Boolean functions. To resist algebraic attack, a Boolean function should possess high algebraic immunity. It is well known now that the algebraic immunity of an $n$-variable Boolean function is upper bounded by $\left\lceil {\frac{n}{2}} \right\rceil $. In this paper, for an odd integer $n$, we present a construction method which can efficiently generate a Boolean function of $n$ variables with maximum algebraic immunity, and we also show that any such function can be generated by this method. Moreover, the number of such Boolean functions is greater than $2^{2^{n-1}}$.
Li Na
Qi Wen-Feng
No associations
LandOfFree
Construction and Count of Boolean Functions of an Odd Number of Variables with Maximum 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 Construction and Count of Boolean Functions of an Odd Number of Variables with Maximum Algebraic Immunity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Construction and Count of Boolean Functions of an Odd Number of Variables with Maximum Algebraic Immunity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-467161