9-variable Boolean Functions with Nonlinearity 242 in the Generalized Rotation Class
Selcuk Kavut, Melek Diker Yucel
备注：
This work is based on (i) "Generalized Rotation Symmetric and Dihedral Symmetric Boolean Functions - 9 variable Boolean Functions with Nonlinearity 242", AAECC-17 Symposium, LNCS Vol. 4851, pp. 321-329, Bangalore, India, 2007 and (ii) "Random Permutations on Input Vectors of Boolean Functions", BFCA 2008, Copenhagen, Denmark, 2008
In 2006, 9-variable Boolean functions having nonlinearity 241, which is strictly greater than the bent concatenation bound of 240, have been discovered in the class of Rotation Symmetric Boolean Functions (RSBFs) by Kavut, Maitra and Yucel. To improve this nonlinearity result, we have firstly defined some subsets of the n-variable Boolean functions as the "generalized classes of k-RSBFs and k-DSBFs (k-Dihedral Symmetric Boolean Functions)", where k is a positive integer dividing n and k-RSBFs is a subset of l-RSBFs if k < l. Secondly, utilizing the steepest-descent like iterative heuristic search algorithm used previously to identify the 9-variable RSBFs with nonlinearity 241, we have made a search within the classes of 3-RSBFs and 3-DSBFs. The search has accomplished to find 9-variable Boolean functions with nonlinearity 242 in both of these classes. It should be emphasized that although the class of 3-RSBFs contains functions with nonlinearity 242; 1-RSBFs or simply RSBFs, which is a subset of 3-RSBFs, does not contain any. This result also shows that the covering radius of the first order Reed-Muller code R(1, 9) is at least equal to 242. Thirdly, motivated by the fact that RSBFs are invariant under a special permutation of the input vector, we have classified all possible permutations up to the linear equivalence of Boolean functions that are invariant under those permutations. Specifically, for 9-variable Boolean functions, 9! possible permutations are classified into 30 classes; and the search algorithm identifies some of these classes as "rich". The rich classes yield new Boolean functions with nonlinearity 242 having different autocorrelation spectra from those of the functions found in the generalized 3-RSBF and 3-DSBF classes.
The Maximum Nonlinearity of 8-variable Balanced Boolean Functions is 116
School of Computer and Electronic Information/School of Artificial Intelligence, Nanjing Normal University（南京师范大学计算机与电子信息学院/人工智能学院）；China Telecom Corporation Limited, Huaibei Branch（中国电信股份有限公司淮北分公司）
Use of Simple Arithmetic Operations to Construct Efficiently Implementable Boolean functions Possessing High Nonlinearity and Good Resistance to Algebraic Attacks
Monotone but Exciting: On Evolving Monotone Boolean Functions with High Nonlinearity
University of Paris 8（巴黎第八大学）；University of Bergen（卑尔根大学）；Faculty of Electrical Engineering and Computing, University of Zagreb（萨格勒布大学电气工程和计算学院）；Semantics, Cybersecurity and Services Group, University of Twente（特文特大学语义、网络安全与服务组）；Digital Security Group, Radboud University（拉波德国立大学数字安全组）
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（拉德堡德大学数字安全组）
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 函数。
