Construction of 1-resilient Boolean functions with optimum algebraic immunity

In this paper, for an integer n≥10, two classes of n-variable Boolean functions with optimum algebraic immunity (AI) are constructed, and their nonlinearities are also determined. Based on non-degenerate linear transforms to the proposed functions, we can obtain 1-resilient n-variable Boolean functions with optimum AI and high nonlinearity if n?1 is never equal to any power of 2.     

最优代数免疫布尔函数的完全构造

任意的布尔函数可以唯一地表示成有限域上的单变元多项式函数,利用布尔函数的单变元多项式表示和代数编码理论,讨论了布尔函数的代数免疫达到最优的判别条件,得到了布尔函数的变元个数为奇数时,布尔函数具有最优代数免疫(MAI)的等价判别条件。利用该等价判别条件,给出3元布尔函数满足MAI的等价判别条件,进而构造出所有3元的MAI布尔函数。     

Construction and enumeration of Boolean functions with maximum algebraic immunity

Algebraic immunity is a new cryptographic criterion proposed against algebraic attacks. In order to resist algebraic attacks, Boolean functions used in many stream ciphers should possess high algebraic immunity. This paper presents two main results to find balanced Boolean functions with maximum algebraic immunity. Through swapping the values of two bits, and then generalizing the result to swap some pairs of bits of the symmetric Boolean function constructed by Dalai, a new class of Boolean functions with maximum algebraic immunity are constructed. Enumeration of such functions is also given. For a given function p(x) with deg(p(x)) < , we give a method to construct functions in the form p(x)+q(x) which achieve the maximum algebraic immunity, where every term with nonzero coefficient in the ANF of q(x) has degree no less than . Supported by the National Natural Science Foundation of China (Grant No. 60673068), and the Natural Science Foundation of Shandong Province (Grant Nos. Y2007G16, Y2008G01)     

On the 2~m-variable symmetric Boolean functions with maximum algebraic immunity

The properties of the 2~m-variable symmetric Boolean functions with maximum al- gebraic immunity are studied in this paper.Their value vectors,algebraic normal forms,and algebraic degrees and weights are all obtained.At last,some necessary conditions for a symmetric Boolean function on even number variables to have maximum algebraic immunity are introduced.     

一类二阶代数免疫函数的结构

对一阶代数免疫函数的结构进行了刻画,在此基础上讨论了一类二阶代数免疫布尔函数的构造问题,给出了两个[n]元一阶代数免疫函数通过级联得到[n]+1元二阶代数免疫函数的充分条件,并且给出了它们的若干结构和几个判断二阶代数免疫函数的判别准则。     

最大代数免疫度的偶变元对称函数的性质

代数免疫度达到最大的偶变元对称布尔函数的特征仍然是个公开问题。结合组合数学和数论的相关结论研究这类函数的性质,得到了此类函数值向量的几个特征。最后,对于变元个数为两类特殊偶数的情况,得到了代数免疫度达到最大的对称函数的一个特征。     

On the construction of multi-output Boolean functions with optimal algebraic immunity

In this paper,we show a construction of multi-output Boolean functions with optimal algebraic immunity.And,the relationship between the algebraic immunity of a multi-output Boolean function and those of its component functions is studied.We show that all the component functions,together with their nonzero linear combination,of the multi-output Boolean functions achieved by this construction have optimal algebraic immunity simultaneously.     

一类特殊布尔函数的代数免疫度研究

构造具有好的代数免疫度的布尔函数是布尔函数研究的重要问题之一。基于布尔函数的级联构造方法,给出了一类具有好的代数免疫度的布尔函数;分析了所构造函数的性质,证明了构造布尔函数hn+1与其子函数代数免疫度之间的关系,并确定了已构造一阶级联函数的代数次数、平衡性以及非线性度。研究结果表明,在级联构造方法下,i次级联构造函数比一阶构造H0的代数免疫度有显著提高。     

布尔函数代数免疫度的研究

代数免疫度是度量布尔函数抵抗代数攻击的重要指标。为了抗代数攻击,布尔函数应具有较高的代数免疫度。对于给定的奇数n,得到一个具有最大代数免疫度的布尔函数重量的可除性结果,同时,在任意有限域上,针对关系式fg=h,研究了它的代数免疫度,给出了一些重要结果。     

On the 2<Superscript>m</Superscript>-variable symmetric Boolean functions with maximum algebraic immunity

The properties of the 2m-variable symmetric Boolean functions with maximum al- gebraic immunity are studied in this paper. Their value vectors, algebraic normal forms, and algebraic degrees and weights are all obtained. At last, some necessary conditions for a symmetric Boolean function on even number variables to have maximum algebraic immunity are introduced.     

具有最优代数免疫阶的一类新布尔函数的构造

构造了一类至少具有次优代数免疫阶的布尔函数f,并利用级联的方法构造了一类具有最优代数免疫阶的布尔函数h。这类函数h不同于以前相关文献中所提出的最优代数免疫的布尔函数,给出了f的数目,并进一步讨论了h（偶数个变元的情况下）的非线性度,发现利用择多函数F_n构造的一类函数h非线性度达到Lobanov界。     

具有最优代数免疫阶平衡布尔函数的递归构造

针对密码学中布尔函数的代数免疫性和构造需求,通过选取适当次数的布尔函数,利用布尔函数的级联性质,提出了一种提高布尔函数代数免疫阶的递归构造法;同时证明了该构造法中所构造的布尔函数比原布尔函数的代数免疫阶高,利用该方法可以递归构造具有最优代数免疫阶平衡布尔函数,最后给出了一个具体实例。     

代数免疫度最优的偶数元旋转对称布尔函数的构造

针对目前许多流密码算法无法抵抗代数攻击问题,提出了一种构造代数免疫度最优的偶数元旋转对称布尔函数的新方法。该方法在择多函数的基础上,通过巧妙选择汉明重量不一的若干轨道,并改变这些轨道上的函数值,从而构造出一类新的旋转对称布尔函数。给定布尔函数达到代数免疫度最优的一个充分条件,通过证明新构造的布尔函数满足该充分条件,从而表明该类函数代数免疫度最优,能够有效抵抗代数攻击。     

New constructions of balanced Boolean functions with high nonlinearity and optimal algebraic degree

In this paper, we propose a technique for constructing balanced Boolean functions on even numbers of variables. The main technique is to utilize a set of disjoint spectra functions and a special Boolean permutation to derive a balanced Boolean function with high nonlinearity and optimal algebraic degree. It is shown that the functions we construct are different from both Maiorana-McFarland's (M-M) super-class functions introduced by Carlet and modified M-M super-class functions presented by Zeng and Hu. Furthermore, we show that they have no nonzero linear structures.     

关于二阶代数免疫布尔函数的几个结果

关于布尔函数的代数免疫性与弹性、代数次数、非线性度之间的关系的结果至今仍然很少,饱和最优布尔函数在流密码领域具有较高的理论价值,通过计算证明文献[1]中命题8给出的5元最优布尔函数都是2阶代数免疫函数,并在此基础上对这个结果做了进一步推广。