密码函数的一类递归构造方法

首先利用递归的方法证明了结构形式更为一般的布尔函数的 Walsh谱分解式，然后利用这类布尔函数Walsh谱分解式，给出了密码学和编码学中具有重要应用价值的一些布尔函数，如弹性函数、Bent函数以及满足严格雪崩准则的布尔函数的构造方法。     

广Bent函数

利用了Bent函数构造了一类新的布尔函数——“广Bent函数”，并分析了广Bent函数的密码学性质，如平衡性、高的非线性度、稳定性等。还给出了广Bent函数仅在一个非零点不满足扩散准则的充要条件，并指出广Bent函数平衡且满足2n次扩散准则的充要条件，最后揭示了平衡且满足k次扩散准则的k 1元布尔函数的结构特征。     

对称布尔函数的代数免疫性

在流密码和分组密码的加密体制中,需要构作具有各种密码学性质的布尔函数,用来作为密钥,以抵抗已有的各种有效攻击方法。近年来,人们提出了代数攻击方法,为了抵抗这种攻击方式,构作代数免疫度很大的布尔函数,成为近五年来信息安全领域一个研究热点。本文综述布尔函数代数免疫性方面的重要问题和主要进展,其中包括中国学者在对称布尔函数代数免疫性的研究成果。     

关于多输出布尔函数的第二类非线性度

本文对多输出布尔函数的第二类非线性度进行研究,该定义是衡量抵抗最佳多输出仿射逼近攻击性能的一项重要准则.利用多输出布尔函数的Walsh变换,我们给出第二类非线性度的一种表达式,并在此基础上得到第二类非线性度的一个上界.进一步地,我们给出了当第一类非线性度达到最优时,其第二类非线性度的一个界.此外,本文还给出任意多输出布尔函数与所有多输出线性函数之间距离的均值.     

与特定密码函数线性等价的布尔函数谱和自相关特征

对线性等价意义下2个布尔函数的密码学性质的异同做了进一步的分析，得到了一个布尔函数线性等价于某个具有m阶相关免疫性的布尔函数的充分必要条件和线性等价于某个满足k次扩散准则的布尔函数的充分必要条件，在线性等价意义上，给出了由不具有相关免疫性且不满足扩散准则的布尔函数，构造既具有相关免疫性、也满足扩散准则的布尔函数的实例。     

相关免疫布尔函数的一种构造方法

本文证明了布尔函数的谱分解定理，定义了布尔函数的谱（分解）特征向量，给出相应的充要条件，将全部Ｎ元相关免疫布尔函数的构造问题转化为线性方程组的求解问题，为相关免疫布尔函数的构造提供了新的方法。）满足，可求得符合要求的用上述方法我们通过人工计算确定出８６个符合要求的谱特征向量，注意到向量中各分量地位的对称性，并注意到定理４，我们得知全部４无相关免疫的非平凡布尔函数共２×３２４＝６４８个Ｎ＝４，ｍ＝２时，定理６中条件即从后面１１个方程可求得联系（Ⅱ）中的第５～１４个方和即知在（Ⅲ４）下ｂ１、ｂ２、ｂ３、ｂ４全为１（全为０平凡情况），在（Ⅲ４）下ｂ１、ｂ２、ｂ３、ｂ４中有３个取１、１个取０，由此可得全部４元至少２阶相关免疫的非平凡布尔函数所对应的谱特征向量如下：它们所对应的的布尔函数依次是（此结论与［１］ｐ１５５上结论相符），因而４元１阶相关免疫的布尔函数共有６４８－１０＝６３８个。一般情况下，在我们的方法里构造全部Ｎ元相关免疫布尔函数实质上是在定理６中“约束条件”（１）下去求２Ｎ－１个变元、Ｎ个方程的方程组（Ⅱ）所有解，构造全部Ｎ元至少ｍ（≥２）附相关免疫布尔函数实质上是在定理６中“约束条件，（１）下去解２Ｎ－     

类差分平衡函数的性质及其应用

定义了布尔函数的类差分和类差分平衡函数，研究了类差分平衡函数的密码学性质以及构造方法。作为类差分平衡函数的应用， 给出了Z24上逻辑函数是完全非线性函数的充要条件，并在首先分析得到所有四元类差分平衡函数的基础上，编程搜索出Z24上所有的完全非线性函数。     

Zn4上完全非线性函数的存在性和构造

给出了剩余类环Z4上的逻辑函数-4值逻辑函数是完全非线性函数的两个条件，引入了布尔函数中“类Bent函数”的概念，并用其构造了自变量个数是偶数的一类4值完全非线性函数，给出了1元4值完全非线性函数不存在性的一个简单证明。     

拟Bent函数的构造

拟Bent函数在密码系统中可用作非线性组合函数和消息摘要函数,因而具有很好的密码学性质。本文通过计算布尔函数的Walsh谱,从映射的角度确定了变元个数不超过六的拟Bent函数的代数结构;提出了一般交换群上的扩展组合函数族的概念,研究了这类函数的性质,利用商群给出了扩展组合函数的下降构造,通过组合函数给出了提升构造法,从而得到了一种由扩展组合函数族构造拟Bent函数和Bent函数的递归构造法,由这种方法可以构造大量拟Bent函数和Bent函数。另外也构造了几种参数的布尔扩展组合函数。     

布尔函数的Walsh谱的概率意义及其应用

本文揭示了布尔函数的Ｗａｌｓｈ谱的概率实质，对布尔函数的线性逼近的最佳意义作出了概率解释．并利用Ｗａｌｓｈ谱的概率意义进行了谱分析．考察了谱的运算性质。文中的方法和结论对密码设计和分析都是有用的。     

Z_4~n上完全非线性函数的存在性和构造

给出了剩余类环Z4上的逻辑函数-4值逻辑函数是完全非线性函数的两个条件,引入了布尔函数中"类Bent函数"的概念,并用其构造了自变量个数是偶数的一类4值完全非线性函数,给出了1元4值完全非线性函数不存在性的一个简单证明。     

Boolean functions with two distinct Walsh coefficients

Are there other Boolean functions having two distinct Walsh coefficients except affine Boolean functions and maximal nonlinear (i.e. bent) Boolean functions? This paper proves that all Boolean functions with exactly two distinct Walsh coefficients are just the two known classes of affine and bent Boolean functions and the Boolean functions obtained by modifying the value of affine or bent Boolean functions at x?=?0.     

Circuit reliability and complexity with similar constant faults in the components

The task is considered of realizing Boolean functions asymptotically the best as regards reliability by circuits with constant faults of the same type only at the outputs or only at the inputs of the gates. The complexity of the circuits made of unreliable components that are asymptotically the best on reliability is of the same order as the complexity of circuits constructed only from reliable components. __________ Translated from Izmeritel’naya Tekhnika, No. 3, pp. 12–15, March, 2006.     

基于布尔逻辑的测试选择算法

提出了一种基于布尔逻辑运算的测试选择新方法.首先建立布尔关联矩阵来描述系统中故障与测试的相关关系;然后依据关联矩阵,分别定义描述故障检测用测试集和故障隔离用测试集的布尔逻辑函数;再根据布尔运算定律对逻辑函数进行展开和化简处理,并根据计算结果得到最优测试集.通过案例验证了该方法的正确性,并指出了该方法的优势及其在计算复杂性方面存在的不足.     

A method of majority logic reduction for quantum cellular automata

The basic Boolean primitive in quantum cellular automata (QCA) is the majority gate. In this paper, a method for reducing the number of majority gates required for computing three-variable Boolean functions is developed to facilitate the conversion of sum-of-products expression into QCA majority logic. Thirteen standard functions are introduced to represent all three-variable Boolean functions and the simplified majority expressions corresponding to these standard functions are presented. We describe a novel method for using these standard functions to convert the sum-of-products expression to majority logic. By applying this method, the hardware requirements for a QCA design can be reduced. As an example, a 1-bit QCA adder is constructed with only three majority gates and two inverters. The adder is designed and simulated using QCADesigner, a design and simulation tool for QCA. We will show that the proposed method is very efficient and fast in deriving the simplified majority expressions in QCA design.     

Sampling Boolean Functions over Abelian Groups and Applications

We obtain efficient sampling methods for recovering or compressing functions over finite Abelian groups with few Fourier coefficients, i.e., functions that are (approximable by) linear combinations of few, possibly unknown Fourier basis functions or characters. Furthermore, our emphasis is on efficiently and deterministically finding small, uniform sample sets, which can be used for sampling all functions in natural approximation classes of Boolean functions. Due to this requirement, even the simplest versions of this problem (say, when the set of approximating characters is known) require somewhat different techniques from the character theory of finite Abelian groups that are commonly used in other discrete Fourier transform applications. We briefly discuss applications of our efficient, uniform sampling methods in computational learning theory, efficient generation of pseudorandom strings, and testing linearity; we also state highly related open problems that are not only applicable in these contexts, but are also of independent mathematical interest. Received: December 14, 1998; revised version: October 20, 1999     

Boolean AND and OR logic for cell signalling gateways: a communication perspective

Cell signalling plays a vital role in development, sustaining, differentiation, and reproduction of cells. Pathways involved in signalling networks are quite interwoven and complex. Complexity encountered in understanding these pathways is often reduced with the help of Boolean circuit representation. In this study, the authors provide communication aspect of the signalling pathways that have two input Boolean logic AND/OR implemented at the rear effector protein. Communication is assumed to be taking place in extracellular and intracellular environment. The two environments are connected using a receptor protein acting as relay between a molecular source and effector protein. Each relay detects molecules from outside environment and stimulates the production of signals in the intracellular space. These signals/molecules further activate the effector protein which acts as a Boolean switch driven by AND/OR logic. Assuming Poisson reception at the relay as well as at the receiver, the authors provide probability of error of the AND and OR Boolean logic communication systems. Furthermore, reliability and some capacity bounds are deduced for the given Boolean communication system.Inspec keywords: cellular biophysics, integrated circuit modelling, stochastic processes, probability, cellular transport, proteins, molecular biophysics, Boolean functions, biochemistryOther keywords: cell signalling, communication perspective, signalling networks, Boolean circuit representation, communication aspect, signalling pathways, input Boolean logic, rear effector protein, extracellular environment, intracellular environment, receptor protein, relay, stimulates, signals/molecules, Boolean switch, Boolean logic communication systems, given Boolean communication system     

Optical threshold-decomposed Boolean-based gray-scale filter

Because of the advances made in optical technology, an extension can be made from the well-known stack filter to a new kind of gray-scale filter by using arbitrary Boolean functions instead of positive Boolean functions in the second step of a three-step process. Applications of these threshold-decomposed Boolean-based gray-scale filters in image processing include image smoothing and feature detection. A general optical implementation approach of nonlinear threshold-decomposed Boolean-based gray-scale filters is also described that utilizes area coding, gray scale correlation and lookup table thresholding techniques. Some experimental results are demonstrated.