From the motivation of algebraic attacks to stream and block ciphers([1,2,7,13,14,15]), the concept of {\em algebraic immunity} (AI) was introduced in [21] and studied in [3,5,10,11,17,18,19,20,21]. High algebraic immunity is a necessary condition for resisting algebraic attacks. In this paper, we give some lower bounds on algebraic immunity of Boolean functions. The results are applied to give lower bounds on AI of symmetric Boolean functions and rotation symmetric Boolean functions. Some balanced rotation symmetric Boolean functions with their AI near the maximum possible value $\lceil \frac{n}{2}\rceil$ are constructed.
On $2k$-Variable Symmetric Boolean Functions with Maximum Algebraic Immunity $k$
布尔函数$f$的代数免疫定义为非零$g$使得$fg=0$或$(f+1)g=0$的最小次数.给定一个正偶数$n$,发现任何具有最大代数免疫度的$n$变量对称布尔函数$\frac{n}{2}$的权重分布都由$n$的二进制展开决定。在此基础上,构造了所有具有最大代数免疫度的$n$变量对称布尔函数.金额为$(2\wt(n)+1)2^{\lfloor \log_2 n \rfloor}$
Use of Simple Arithmetic Operations to Construct Efficiently Implementable Boolean functions Possessing High Nonlinearity and Good Resistance to Algebraic Attacks
On Counts and Densities of Homogeneous Bent Functions: An Evolutionary Approach
University of Bergen(卑尔根大学);Faculty of Electrical Engineering and Computing, University of Zagreb(萨格勒布大学电气工程和计算学院);Semantics, Cybersecurity and Services Group, University of Twente(特温特大学语义、网络安全与服务组);Otto-von-Guericke University Magdeburg(马格德堡奥托·冯·格里克大学)
针对序列与分组密码安全所需的强密码学性质布尔函数设计问题,本文提出用进化算法进化齐次 Bent 布尔函数,引入密度概念优化算法设计,成功找到不同变量数下的二次和三次齐次 Bent 函数。
IDEM Enough? Evolving Highly Nonlinear Idempotent Boolean Functions
University of Paris 8(巴黎第八大学);University of Bergen(卑尔根大学);Faculty of Electrical Engineering and Computing, University of Zagreb(萨格勒布大学电气工程和计算学院);University of Twente(特文特大学);Digital Security Group, Radboud University(拉德堡德大学数字安全组)