布尔函数Walsh变换的非零取值个数

设Wf(y)(y∈F2^r)是布尔函数f：F2^r→F2的Walsh变换．Sf为Wf(y)≠0的y个数，S为所有Sf的并集(其中f过所有可能的布尔函数)．决定集合S是通信和信息安全领域一个重要问题．本文利用群环工具给出研究这一问题的新方法．用这种方法以统一方式证明了[4]中的结果．并利用群环方法给出了关于集合S的一系列新结果．     

具有特定非零Walsh谱值个数的布尔函数的研究及构造

布尔函数与其变元的相关性与流密码的相关攻击有紧密联系，Walsh变换则是研究布尔函数相关特性的主要工具，本文研究了非零Walsh谱值个数k=9，10的布尔函数，证明了k=9的函数的不存在性，并构造了所有k=10的函数。     

概率方法在布尔函数相关免疫性研究中的应用

本文揭示了布尔函数的Ｗａｌｓｈ谱及“相关度”的概率实质，证明了Ｗａｌｓｈ谱的两条重要性质，正确地揭示了多维布尔向量函数的相关免疫性与其各分量的相关免疫性之间的关系；定义了布尔向量函数的Ｗａｌｓｈ变换及Ｗａｌｓｈ谱，并由此给出了与Ｘｉａｏ－Ｍａｓｓｅｙ定理相应的判别条件。     

布尔函数的判定树复杂性及问题

设f（x₁,x₂,…,x_n）是一个布尔函数。如果计算f（x₁,x₂,…,x_n）的每个判定树算法在最坏情况下都要检查所有n个变量才能求得f的值,则称f是诡秘函数。1988年,A.C.C.Yao提出一个问题:如果一个单调非平凡的布尔函数f（x₁,x₂,…,x_n）在循环群C_m×C_n的直积的可迁作用下不变,则f是诡秘的吗?对这个问题的肯定回答支持著名的Rivest-Vuillemin猜想.本文将部分地解答这一问题.     

关于满足SAC的布尔函数

首先讨论了满足ＳＡＣ的布尔函数的性质，然后构作了一类满足ＳＡＣ的布尔函数且讨论了它们的一些密码特性。     

布尔函数的密码性质

当前,密码学面临的一个挑战性问题是构造具有多种密码学性能的布尔函数,用来作为流密码和分组密码的密钥,以同时抵抗现有的多种破译和攻击方式。本文综述了近年来国内外在这方面的研究和进展。     

可分图精度矩阵的精确分布函数

本文给出了从可分图协方差矩阵的分布密度函数确定图精度矩阵分布密度函数的一般方法，得到了可分的Gaussian图模型中精度矩阵极大似然估计的分布密度函数表达式．当图协方差矩阵的分布密度分别服从超逆Wishart分布、超逆Г分布时，也得到了图精度矩阵分布密度函数的解析表达式．     

复合Mlinex损失函数下指数威布尔分布参数的Bayes估计

基于复合Mlinex损失函数,研究了指数威布尔分布的参数在先验分布为伽玛分布的B ayes估计,E-B ayes估计和多层Bayes估计.并用数值模拟的方法进行验证,结果表明三种估计方法的稳健性好,精确度较高.     

布尔函数的迹Walsh谱

布尔函数线性Walsh谱和高阶Walsh谱的研究对构造能够抵抗线性逼近攻击和二次或较高次逼近攻击的密码函数发挥了重要作用.为了抵抗采样攻击,提出了布尔函数迹Walsh谱和迹Walsh循环谱概念,并给出该Walsh谱的一些简单性质.利用这一谱值的分布特性,可以很好地分析布尔函数的迹函数逼近问题,对序列密码采样攻击研究具有重要意义.     

Asymptotic Nonlinearity of Boolean Functions

Boolean functions on the space are not only important in the theory of error-correcting codes, but also in cryptography. In these two cases, the nonlinearity of these functions is a main concept. Carlet, Olejár and Stanek gave an asymptotic lower bound for the nonlinearity of most of them, and I gave an asymptotic upper bound which was strictly larger. In this article, I improve the bounds and get an exact limit for the nonlinearity of most of Boolean functions. This article is inspired by a paper of G. Halász about the related problem of real polynomials with random coefficients. AMS Classification (2000) Primary: 11T71 · Secondary: 06E30 · 42A05 · 94C10     

Universal Affine Classification of Boolean Functions

In this paper we advance a practical solution of the classification problem of Boolean functions by the affine group – the largest group of linear transformations of variables. We show that the affine types (equivalence classes) can be arranged in a unique infinite sequence which contains all previous lists of types. The types are specified by their minimal representatives, spectral invariants, and stabilizer orders. A brief survey of the fundamental transformation groups is included.     

On Partial Classes Containig All Monotone and Zero-Preserving Total Boolean Functions

We describe sets of partial Boolean functions being closed under the operations of superposition. For any class A of total functions we define the set ??(A) consisting of all partial classes which contain precisely the functions of A as total functions. The cardinalities of such sets ??(A) can be finite or infinite. We state some general results on ??(A). In particular, we describe all 30 closed sets of partial Boolean functions which contain all monotone and zero-preserving total Boolean functions.     

Vectorial Resilient PC（l） of Order k Boolean Functions from AG-Codes

Propagation criteria and resiliency of vectorial Boolean functions are important for cryptographic purpose (see [1–4, 7, 8, 10, 11, 16]). Kurosawa, Stoh [8] and Carlet [1] gave a construction of Boolean functions satisfying PC(l) of order k from binary linear or nonlinear codes. In this paper, the algebraic-geometric codes over GF(2m) are used to modify the Carlet and Kurosawa-Satoh’s construction for giving vectorial resilient Boolean functions satisfying PC(l) of order k criterion. This new construction is compared with previously known results.     

Interior and exterior functions of positive Boolean functions

The interior and exterior functions of a Boolean function f were introduced in Makino and Ibaraki (Discrete Appl. Math. 69 (1996) 209–231), as stability (or robustness) measures of the f. In this paper, we investigate the complexity of two problems -INTERIOR and -EXTERIOR, introduced therein. We first answer the question about the complexity of -INTERIOR left open in Makino and Ibaraki (Discrete Appl. Math. 69 (1996) 209–231); it has no polynomial total time algorithm even if is bounded by a constant, unless P=NP. However, for positive h-term DNF functions with h bounded by a constant, problems -INTERIOR and -EXTERIOR can be solved in (input) polynomial time and polynomial delay, respectively. Furthermore, for positive k-DNF functions, -INTERIOR for two cases in which k=1, and and k are both bounded by a constant, can be solved in polynomial delay and in polynomial time, respectively.     

在仿射等价类中找具有好的密码学性质的布尔函数

The Boolean functions in an affine equivalence class are of the same algebraic degree and nonlinearity, but may satisfy different order of correlation immunity and propagation criterion. A method is presented in this paper to find Boolean functions with higher order correlation immunity or satisfying higher order propagation criterion in an affine equivalence class. 8 AES s-box functions are not better Boolean functions in their affine equivalence class.     

Approximation of Boolean Functions by Local Search

Usually, local search methods are considered to be slow. In our paper, we present a simulated annealing-based local search algorithm for the approximation of Boolean functions with a proven time complexity that behaves relatively fast on randomly generated functions. The functions are represented by disjunctive normal forms (DNFs). Given a set of m uniformly distributed positive and negative examples of length n generated by a target function F(x ₁,...,x _n), where the DNF consists of conjunctions with at most literals only, the algorithm computes with high probability a hypothesis H of length m · such that the error is zero on all examples. Our algorithm can be implemented easily and we obtained a relatively high percentage of correct classifications on test examples that were not presented in the learning phase. For example, for randomly generated F with n = 64 variables and a training set of m = 16384 examples, the error on the same number of test examples was about 19% on positive and 29% on negative examples, respectively. The proven complexity bound provides the basis for further studies on the average case complexity.     

Boolean Metric Spaces and Boolean Algebraic Varieties

Abstract

The concepts of Boolean metric space and convex combination are used to characterize polynomial maps A ⁿ ?→?A ^m in a class of commutative Von Neumann regular rings including p-rings, that we have called CFG-rings. In those rings, the study of the category of algebraic varieties (i.e., sets of solutions to a finite number of polynomial equations with polynomial maps as morphisms) is equivalent to the study of a class of Boolean metric spaces, that we call here CFG-spaces.     

Boolean Functions with Five Controllable Cryptographic Properties

The strict avalanche criterion (SAC) was introduced by Webster and Tavares [10] in a study of cryptographic design criteria. This is an indicator for local property. In order to improve the global analysis of cryptographically strong functions, Zhang and Zheng [11] introduced the global avalanche characteristics (GAC). The sum-of-squares indicator related to the GAC is defined as _f = _{v f} ²(v), where _f (v)=x (–1) ^f (x)f(x v). In this paper, we give a few methods to construct Boolean functions controlling five good cryptographic properties, namely balancedness, good local and GAC, high nonlinearity and high algebraic degree. We improve upon the results of Stanica [8] and Zhang and Zheng [11].     

Generating cryptographically strong Boolean functions using partial information

Periodica Mathematica Hungarica - In our paper we study the usage of partially defined Boolean functions (PDBFs) for generating cryptographically strong Boolean functions. A PDBF can be considered...