奇数变元代数免疫最优布尔函数的构造方法

Construction of Odd-variable Boolean Function with Optimum Algebraic Immunity

代数免疫是随着代数攻击的出现而提出来的一个新的密码学特性。为了有效地抵抗代数攻击,密码系统中使用的布尔函数必须具有最佳的代数免疫。提出了递归构造奇数变元代数免疫最优布尔函数的一个方法。这是一个递归构造的方法,利用该方法,对任意的奇数,都可以构造相同变元数量的代数免疫最优布尔函数。

Algebraic immunity is a new cryptographic criterion proposed to against algebraic attacks.In order to resist algebraic attacks,Boolean functions used in many stream ciphers should have optimum algebraic immunity.This paper presented a construction of Boolean function in odd variables with optimum algebraic immunity.It＇s a recursive construction.Given any odd number,we can construct Boolean function with optimum algebraic immunity in the same number of variables.