查询词典 Boolean operation

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)旋转对称饱和最优函数的代数免疫和一类构造函数的代数免疫，证明了一类函数为代数攻击不变量，并对此性质作了进一步推广。

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的限布尔代数也有且只有个元素。

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的仿射项的符合率，分析了它们抵抗最佳仿射逼近攻击和差分攻击的能力；其次，我们合理地给出了布尔向量函数最佳仿射逼近的新定义，利用布尔随机变量联合分布的分解式考察了相应的谱特征，并给出了布尔向量函数与其最佳仿射逼近的符合率的一个下界；最后，我们还考察了布尔向量函数第二类非线性度的谱特征，给出了布尔向量函数第二类非线性度的一个上界，并揭示了布尔向量函数第二类非线性度与其各个分量的线性和的线性结构之间存在的制约关系。

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阶广义ε-相关免疫布尔向量函数的代数次数不受相关免疫阶数的制约。

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.

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

If you want to use a non-boolean in a boolean test, such as if, you must first convert it to a boolean value using a conditional expression, such as ifa !

若想在一次布尔测试中使用一个非布尔值——比如在if里，那么首先必须用一个条件表达式将其转换成一个布尔值，例如ifa！

The concepts of MP-filters and Boolean MP-filters in NML algebras are introduced in this paper, and by using MP-filters, the structure of NML algebras are established: If F is the Boolean filters, then M/~ is the Boolean algebras, i. e. the quotient algebra of NML algebras is obtained.

讨论了NML代数的性质，并且在NML代数上引入MP-滤子与MP-理想以及布尔MP-滤子的概念，并利用布尔MP-滤子建立了NML代数的结构：若F是布尔滤子，则M/~是布尔代数，即NML代数的商代数是布尔代数。

Introduced Fan Boolean Algebra theory as a whole, after analyzing and studying of it, concluded that: the characteristic of Fan Boolean Algebra has determined that it can solve the extant problem of Data Mining to a certain extent, for example, it can guarantee the result after data mining to be usable , assured and construable;can solve the problems about expression difficulty of complicated concept, correlation of attributes emphasized incompletely and redundant examining;it can set up the unified model of Fan Boolean in a certain system;and it can promote the developmental research of new decision support system.

对泛布尔代数进行总体介绍，在分析和研究它的理论体系后，概括出：它的特性决定了它能在一定程度上解决数据挖掘的现存问题，比如可以保证数据挖掘结果的可用性、确定性及可解释性，可以解决复杂概念表达困难、属性间的相互关系强调不够、重复检验等问题；能就某一系统建立统一的泛布尔模型；并促进新型决策支持系统的开发研究，并对泛布尔代数与数据挖掘相结合的原理展开论述。

The synopsis of Boolean operation's research status quo is offered, and a Boolean operation algorithm based on inner point recognition on the basis of Wu Yunxing's edge recognition is put forward.

摘要论文对二维布尔运算的研究现状进行了概述，在武运兴边界识别算法的基础上提出了一种基于"内点"识别的布尔运算算法。

Although translator has turned from being a crystal ball by which the original culture can unrestrainedly penetrate to another crystal ball by which the target culture can freely traverse, the translator's personal embodiment, in the process of cognitive act, are still absent in translation studies. Translators are still subjects without body or simply disembodied subjects.

译者虽然由原语文化可以自由穿透的玻璃球变成了译语文化可以自由穿越的玻璃球，但译者认知过程中的个体体验在翻译研究中依然缺席，译者依然仅仅是一个没有躯体体验的主体。

Chillingly, he claimed our technology is 'not nearly as sophisticated' as theirs and "had they been hostile", he warned 'we would be been gone by now'.

令人毛骨悚然的，他声称我们的技术是'并不那么复杂，像他们一样，和"如果他们敌意"，他警告说，'我们将现在已经过去了。