Boolean matrix

Boolean matrix的基本解释

-

布尔矩阵

与Boolean matrix相关的网络例句 [注：此内容来源于网络，仅供参考]

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

Therefore, in order to offer reference to readers, the paper systematically expound and prove the eigenvalue of special matrix that base on idempotent matrix, antiidempotent matrix, involutory matrix, anntiinvolutory matrix, nilpotent matrix, orthogonal matrix, polynomial matrix, the shape of , matrix, diagonal matrix, invertidle matrix, adjoint matrix, similar matrix, transposed matrix, numerical matrix, companion matrix, and practicality and superiority of the achievement was showed by some examples.

为此本文系统地阐述幂等矩阵，反幂等矩阵，对合矩阵，反对合矩阵，幂零矩阵，正交矩阵，多项式矩阵，形为：，矩阵，对角矩阵，可逆矩阵，伴随矩阵，相似矩阵，转置矩阵，友矩阵一系列特殊矩阵的特征值问题并加以证明，并通过一些具体例子展示所得成果的实用性和优越性。

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

与Boolean matrix相关的网络解释 [注：此内容来源于网络，仅供参考]

Boolean matrix representation：布尔矩阵表示法

布尔矩阵乘法 Boolean matrix multiplication | 布尔矩阵表示法 Boolean matrix representation | 布尔矩阵和 Boolean matrix sum

Boolean matrix representation：布林矩阵表示法

"布林矩阵乘法","Boolean matrix multiplication" | "布林矩阵表示法","Boolean matrix representation" | "布林矩阵和","Boolean matrix sum"

OR：Boolean Search

Boolean operator | 布尔算子, 逻辑算子 | Boolean Search | 逻辑搜索, 一种用逻辑符号如AND,OR,NOT提取信息的方法 | Boolean secondary | 布尔二次式