查询词典 generalized Boolean algebra

31 Chapter 3 Number Systems and Boolean Algebra 3.2 Boolean Algebra Table 3-2 Distributivity Idempotency Absorption laws 分配律同一律吸收律 a=ab+ac a+= a+a=a aa=a a+ab=a a=a'=a'b''=a'+b' DeMorgan's laws德摩根定理计算机专业英语 3-32 Chapter 3 Number Systems and Boolean Algebra 3.2 Boolean Algebra Since a finite set of n elements has exactly 2n subsets, and it can be shown that the finite Boolean algebras are precisely the finite set algebras, each finite Boolean algebra consists of exactly 2n elements for some integer n.

由于n个元素的有限集有且只有个子集由于个元素的有限集有且只有2n个子集，而且很显然有限布个元素的有限集有且只有个子集，尔代数一定是有限集合代数，所以对某个整数n而言而言，尔代数一定是有限集合代数，所以对某个整数而言，每个有限布尔代数也有且只有2n个元素。例如，上文定义的集合T的限布尔代数也有且只有个元素。

Using the theories of probability, algebra and spectral theory comprehensively, we investigate some related characteristics of logic functions in cryptography: Firstly, we introduce m order generalized s - correlation immunity of Boolean vector functions and prove that the higher order generalized ε- correlation immunity can guarantee the lower order generalized ε- correlation immunity. Then by applying decomposition formula of joint distribution of Boolean random vectors, we give a spectrum criterion of m order generalized e - correlation immunity of Boolean vector functions. Furthermore, we show that the algebraic degree of m order generalized e - correlation immune Boolean vector functions is not restricted by the correlation immune orders.

本文主要运用概率论的思想和方法，并结合代数学和频谱理论的相关知识，对密码学中逻辑函数的有关性质进行了研究，主要包括以下三个方面的内容：首先，对布尔向量函数的相关免疫性进行了拓展，给出了k维布尔向量函数m阶广义ε-相关免疫的概念，证明了布尔向量函数的高阶广义ε-相关免疫性蕴含低阶广义ε-相关免疫性，并根据布尔随机向量联合分布分解式得到了布尔向量函数m阶广义ε-相关免疫的一个谱判别条件，还说明了m阶广义ε-相关免疫布尔向量函数的代数次数不受相关免疫阶数的制约。

Based on the outcome of Xu Yang and Qin Keyun about lattice implication algebra and lattice-valued prepositional logic LP with truth-value in a lattice implication algebra, the author studied the properties of lattice implication algebra and the α-automated reasoning method based on α-resolution principle of LP. The specific contents are as follows: The Study of Lattice Implication Algebra On the basis of previous results of lattice implication algebra, this part consists of the following three points: 1. Some properties of lattice implication algebra L were discussed, and some important results were given if L was a complete lattice implication algebra. 2. The properties of left idempotent elements of lattice implication algebras were discussed, and the conclusion that lattice implication algebra L was equals of the directed sum of the range and dual kernel of a left map constructed by a left idempotent element was proved. 3. The properties of the filters of lattice implication algebra were discussed, the theorem was shown that they satisfy the hypothetical syllogism and substitute theorem of the propositional logic. 4. The concept of weak niters of lattice implication algebras and their properties and structures are discussed. It is proved that all weak filters of a lattice implication algebra form a topology and the the implication isomorphism betweem two lattice implication algebras is a topological mapping between their topological spaces. The Study of α-automated reasoning method based on the lattice-valued propositional logic LP In this part, the author given an a-automated reasoning method based on the lattice-valued propositional logic LP.

本文基于徐扬和秦克云的关于格蕴涵代数和以格蕴涵代数为真值域的格值命题逻辑系统LP的研究工作，对格蕴涵代数以及格值命题逻辑系统LP中基于α-归结原理的自动推理方法进行了系统深入的研究，主要有以下两方面的研究成果：一、关于格蕴涵代数的研究 1、对格蕴涵代数的格论性质进行了研究，得到了当L为完备格蕴涵代数时，关于∨，∧，→运算的一些结果； 2、对格蕴涵代数的左幂等元进行了研究，证明了格蕴涵代数L可以分解为任何一个左幂等元所对应的左映射的像集合与其对偶核的直和； 3、对格蕴涵代数的滤子的性质进行了研究，证明了滤子的结构相似于逻辑学中的Hypothetical syllogism规则和替换定理； 4、给出了格蕴涵代数中弱滤子的概念，对弱滤子的性质个结构进行了研究，证明了格蕴涵代数的全体弱滤子构成一个拓扑结构，格蕴涵代数之间的蕴涵同构是相应的拓扑空间之间的拓扑映射。

Using the concept of Boolean functions and combinatorics theory comprehensively, we investigate the construction on annihilators of Boolean functions and the algebraic immunity of symmetric Boolean functions in cryptography:Firstly, we introduce two methods of constructing the annihilators of Boolean functions, Construction I makes annihilators based on the minor term expression of Boolean function, meanwhile we get a way to judge whether a Boolean function has low degree annihilators by feature matrix. In Construction II, we use the subfunctions to construct annihilators, we also apply Construction II to LILI-128 and Toyocrypt, and the attacking complexity is reduced greatly. We study the algebraic immunitiy of (5,1,3,12) rotation symmetric staturated best functions and a type of constructed functions, then we prove that a new class of functions are invariants of algebraic attacks, and this property is generalized in the end.Secondly, we present a construction on symmetric annihilators of symmetric Boolean functions.

本文主要利用布尔函数的相关概念并结合组合论的相关知识，对密码学中布尔函数的零化子构造问题以及对称布尔函数代数免疫性进行了研究，主要包括以下两方面的内容：首先，给出两种布尔函数零化子的构造方法，构造Ⅰ利用布尔函数的小项表示构造零化子，得到求布尔函数f代数次数≤d的零化子的算法，同时得到通过布尔函数的特征矩阵判断零化子的存在性：构造Ⅱ利用布尔函数退化后的子函数构造零化子，将此构造方法应用于LILI-128，Toyocrypt等流密码体制中，使得攻击的复杂度大大降低；通过研究(5，1，3，12)旋转对称饱和最优函数的代数免疫和一类构造函数的代数免疫，证明了一类函数为代数攻击不变量，并对此性质作了进一步推广。

150 Chapter 1 The History and Future of Computers 3.2 Boolean Algebra Table 3-2 Distributivity Idempotency Absorption laws 分配律同一律吸收律 a=ab+ac a+= a+a=a aa=a a+ab=a a=a'=a'b''=a'+b' DeMorgan's laws德摩根定理计算机专业英语 1-151 Chapter 1 The History and Future of Computers 3.2 Boolean Algebra Since a finite set of n elements has exactly 2n subsets, and it can be shown that the finite Boolean algebras are precisely the finite set algebras, each finite Boolean algebra consists of exactly 2n elements for some integer n.

由于n个元素的有限集有且只有个子集由于个元素的有限集有且只有2n个子集，而且很显然有限布个元素的有限集有且只有个子集，尔代数一定是有限集合代数，所以对某个整数n而言而言，尔代数一定是有限集合代数，所以对某个整数而言，每个有限布尔代数也有且只有2n个元素。例如，上文定义的集合T的限布尔代数也有且只有个元素。

First of all, the dissertation proves that the three structures are pairwisely isomorphic—the Boolean Algebra formed by the value range topological space, the Boolean Algebra by knowledge nodes, and the Boolean Algebra by data sub-classes. Thus the essential relations between the three Boolean Algebras are constructed. Furthermore, The three structures have the same multiplying mechanism.

首先，论文从理论上证明了由数值域拓扑空间形成的布尔代数、由知识结点集形成的布尔代数、和由数据子类结构集形成的布尔代数在结构上有两两同构的关系，从而建立了了这三者在本质上的联系，并且论证了它们具有相同的"繁衍"机制。

Chapter three: Define fuzzy congruence relation of MTL-algebra, prove that fuzzy fiter and fuzzy congruence relation is a bijective function in MTL-algebra, quotient algebra induced by congruence relation still forms a MTL-algebra; Introduce the relation between some kinds of fiters and fuzzy filters maitained above in IMTL-algebra,i.e. BR_0 algebra, which is a MTL-algebra satisfied inversely odering and involutive relation.

第三章：定义了MTL-代数中的Fuzzy同余关系，证明了MTL-代数中Fuzzy滤子与Fuzzy同余关系是——对应的，由同余关系所诱导的商代数依然构成一个MTL-代数；介绍了在满足逆序对合对应的MTL-代数-IMTL-代数，即BR_0-代数中上述几中特殊滤子，Fuzzy滤子之间的关系。

The most famous rough algebras are Rough Double Stone Algebra, Rough Nelson Algebra and Approximation Space Algebra, and their corresponding general algebra structures are regular double Stone algebra, semi-simple Nelson algebra and pre-rough algebra respectively.

其中最有影响的粗代数分别是粗双Stone代数、粗Nelson代数和近似空间代数，它们对应的一般代数结构分别是正则双Stone代数、半简单Nelson代数和预粗代数。

The third part proposes in Luk the concept of lattice-valued truth degrees based on the second part by generalizing truth values from the MV-unit interval(a special MV-algebra) to a general MV-algebra. And the properties of lattice-valued truth degrees suggest that this generalization is natural and reasonable. Because of the equivalence between the two algebra systems, i.e. MV-algebra and lattice implication algebra, it's natural and easy to grade the truth of formulas in lattice-valued propositional logic whose basic algebra system is the lattice implication algebra.

中。 本文第三部分在第二部分的基础上，将Luk中公式的真度值推广到了一般的MV代数上，相对于第二部分的数值真度，给出公式的格值真度，并通过格值真度的性质说明格值真度是数值真度的合理推广。

In the fourth chapter, firstly it introduces the Boolean functions algebraic expressions of the 2-value clock-controlled stop-and-go generator and Gunther generator. It reveals the balanced property of the two kinds of Boolean functions, and studies the Walsh cycle spectrum and the autocorrelation function. It also obtains the coincidence rate of their output sequences with affine sum of some bits of input sequences, and analyzes their ability of resisting the best affine approximation cryptanalysis and differential cryptanalysis. Secondly, we properly present a new definition of the Best Affine Approximation, namely BAA on the Boolean vector functions, followed by the spectral characteristic of such defined BAA attacks through using the decomposition formula of the union distribution for random variables. A lower bound of such BAA attacks is proposed. Finally, we also study the spectral characteristic of the second kind of nonlinearity of Boolean vector functions, followed by a higher bound of such nonlinearity. Furthermore, the limited relationship between the second kind of nonlinearity of Boolean vector functions and the linear structure of the linear combination of every component is analyzed.

在第四章中，首先给出了2值密钥流"停走生成器"和"衮特生成器"中实际存在的布尔函数的代数表示，揭示了这两类布尔函数的平衡性，随后研究了它们的Walsh循环谱和自相关函数等，得到了它们的输出序列与输入序列中的某些bit的仿射项的符合率，分析了它们抵抗最佳仿射逼近攻击和差分攻击的能力；其次，我们合理地给出了布尔向量函数最佳仿射逼近的新定义，利用布尔随机变量联合分布的分解式考察了相应的谱特征，并给出了布尔向量函数与其最佳仿射逼近的符合率的一个下界；最后，我们还考察了布尔向量函数第二类非线性度的谱特征，给出了布尔向量函数第二类非线性度的一个上界，并揭示了布尔向量函数第二类非线性度与其各个分量的线性和的线性结构之间存在的制约关系。

But this is impossible, as long as it is engaging in a market economy, there are risks in any operation.

但是，这是不可能的，只要是搞市场经济，是有风险的任何行动。

We're on the same wavelength.

我们是同道中人。