基于代数正规型构造的代数免疫最优布尔函数  

Optimal Algebraic Immune Boolean Function Based on Algebraic Normal Form Construction

作　　者：董新锋 张文政 周宇 曹云飞 穆道光 

机构地区：[1]保密通信重点实验室,成都610041

出　　处：《计算机工程》2013年第7期169-172,共4页Computer Engineering

基　　金：保密通信重点实验室基金资助项目(9140C110201110C1102)

摘　　要：现有代数免疫最优布尔函数的构造方法大多基于支撑集,通过代数正规型直接构造的方法研究较少。为此,利用代数正规型的多项式表示构造一类代数免疫性质优的布尔函数,研究其代数次数、代数免疫阶、函数重量、非线性度等性质,分析采用这种方法构造的代数免疫最优布尔函数的性质及计数等结果。由构造方法可以得到代数免疫最优的布尔函数,其中包含一些已有的特殊构造结果,表明该方法更具有一般性,包含更多具有最优代数免疫阶的函数。The present methods of constructing optimal algebraic immune Boolean functions are mostly based on the support set. The methods by algebraic normal form are few. This paper gives a method of constructing optimal algebraic immune Boolean functions by algebraic normal form, and studies the primarily cryptographic properties of these functions. Such as algebraic degree, the algebraic immunity, the hamming weight, the nonlinearity etc. The number of the constructed optimal algebraic immune functions is given. By using the construction method, a large class of Boolean functions can be obtained with optimal algebraic immunity, which contains some special known results, and shows this method is more general, contains more functions with maximum algebraic immunity order.

关 键 词：布尔函数 代数正规型 代数免疫阶 零化子 非线性度 k-正规 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]