arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.6604cs.CR
收藏

基于有限域的加法分解构造具有潜在最优代数免疫性的布尔函数

Constructing Boolean Functions With Potential Optimal Algebraic Immunity Based on Additive Decompositions of Finite Fields

Baofeng Wu, Qingfang Jin, Zhuojun Liu, Dongdai Lin

摘要:

提出了一种基于有限域$\mathbb{F}_{2^{(r+1)m}}$的加法分解$\mathbb{F}_{2^{rm}}\times\mathbb{F}_{2^m}$构造$(r+1)m$变量的密码学有效布尔函数的一般方法,其中$r$为奇数,$m\geq3$为整数.首先用这种方法构造了一类非平衡函数,它与广义Tu-Deng函数的非平衡类在$r=1$情形下的一个变体相一致.这类函数具有很高的代数次数,但其代数免疫度不超过$m$,当$r>1$时不可能是最优的。通过对这些不平衡函数的修正,得到了一类具有最优代数次数和高非线性度的平衡函数(证明了其下界)。这些函数具有最优的代数免疫性,从而证明了二元串上的组合猜想是正确的,推广了屠-邓猜想。计算机研究表明,至少对于变量数较小的值,此类函数也能很好地抵抗快速代数攻击。

英文摘要:

We propose a general approach to construct cryptographic significant Boolean functions of $(r+1)m$ variables based on the additive decomposition $\mathbb{F}_{2^{rm}}\times\mathbb{F}_{2^m}$ of the finite field $\mathbb{F}_{2^{(r+1)m}}$, where $r$ is odd and $m\geq3$. A class of unbalanced functions are constructed first via this approach, which coincides with a variant of the unbalanced class of generalized Tu-Deng functions in the case $r=1$. This class of functions have high algebraic degree, but their algebraic immunity does not exceeds $m$, which is impossible to be optimal when $r>1$. By modifying these unbalanced functions, we obtain a class of balanced functions which have optimal algebraic degree and high nonlinearity (shown by a lower bound we prove). These functions have optimal algebraic immunity provided a combinatorial conjecture on binary strings which generalizes the Tu-Deng conjecture is true. Computer investigations show that, at least for small values of number of variables, functions from this class also behave well against fast algebraic attacks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑