具有最大代数免疫性的奇数变元布尔函数的构造与计数
Construction and Count of Boolean Functions of an Odd Number of Variables with Maximum Algebraic Immunity
摘要:
代数免疫性是布尔函数的一个重要性质。为了抵抗代数攻击,布尔函数必须具有高的代数免疫性。众所周知,$n$ -变量布尔函数的代数免疫性的上界是由$\left\lceil {\frac{n}{2}} \right\rceil $确定的。本文对奇数$n$给出了一种构造方法,该方法可以有效地生成具有最大代数免疫度的$n$变量布尔函数,并证明了任何这样的函数都可以用这种方法生成.此外,这种布尔函数的数量大于$2^{2^{n-1}}$。
英文摘要:
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}}$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。