查询词典 boolean function

From this,two algorithms to find low degree annihilators of a Boolean function are present:complete searching and stochastic searching.The complete one can not only get all the low degree annihilators of a Boolean function,but also get the algebraic immunity of the function.

利用完全搜索法可以得到布尔函数的所有低次零化子，同时还可以确定该布尔函数的代数免疫度；利用随机搜索法能快速得到布尔函数的任意一个低次零化子。

Fn:not The argument is first reduced to a boolean value by applying the boolean function.

自变量是第一个成为适用于boolean函数的逻辑值。

Bent function is a class of the highest nonlinearity Boolean function, and Boolean function is the key in the cipher system.

Bent函数是一类具有最高非线性度的布尔函数，布尔函数是对称加密密码体制设计和分析的关键。

By analyzing the relationship between the algebraic degree and characteristic matrix of a Boolean function,the relationship between the algebraic immunity and characteristic matrix of a Boolean function is obtained.

通过分析布尔函数的代数次数与特征矩阵的关系，得到了布尔函数的代数免疫度与特征矩阵的关系。

Second, in the viewpoint of crypto analysis, the practical requirement for the cryptographic function is to construct the function that can resist all the known crypto analysis and attacks. In advanced, the main cryptographic properties are compared, and the relation among these cryptographic properties is analyzed, including the trade-off ones. Get the conclusion that the construction of cryptographic Boolean function is to find out the proper Boolean function in the whole vector space under the restriction of several cryptographic properties required for the security system.

然后本文从密码分析的角度，讨论了密码函数的实际需求，即构造能够抵抗已有密码分析与攻击的布尔函数；分析了布尔函数的主要的密码学性质，并比较了这些性质之间的相互关系，包括制约的关系；得出了构造布尔函数的实质的结论，即在向量空间中构造全体布尔函数，以所需的若干密码学性质作为限制条件，用有限域上的多项式、Walsh谱、Hadamard矩阵等数学工具找出适当的布尔函数用于加密体制的设计。

Based on the definition of Boolean function on set and positive extension, The sufficient and necessary condition of PBF is proven. At last, an algorithm of generating MSP expression of stack filter positive Boolean function is presented taking advantage of Hasse diagram.

通过定义布尔函数开、闭集和最小项正、负扩展，证明了布尔函数具有层叠性的充要条件是布尔函数开集的正扩展或闭集的负扩展具有不变性，在此基础上，提出了一种通过Hasse图确定层叠滤波器最简正布尔函数的算法。

Based on the definition of Boolean function on set and positive extension, The sufficient and necessary condition of PBF is proven. At last,an algorithm of generating MSP expression of stack filter positive Boolean function ispresented taking advantage of Hasse diagram.

通过定义布尔函数开、闭集和最小项正、负扩展，证明了布尔函数具有层叠性的充要条件是布尔函数开集的正扩展或闭集的负扩展具有不变性，在此基础上，提出了一种通过Hasse图确定层叠滤波器最简正布尔函数的算法。

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

To prove that we can construct any boolean function using only NAND gates, we needonly show how to build an inverter, AND gate, and OR gate from a NAND (sincewe can create any boolean function using only AND, NOT, and OR).

为了证明使用NAND门我们能够构造任何布尔函数，我们只需要展示如何从一个NAND建立一个转换，与门，或门（因为我们可以用AND，OR，NOT建立任何布尔函数）。

Through deducing the representation of the nonlinearity part of the symmetric cipher in Boolean function, the equivalence between symmetric cipher design and Boolean function is verified.

通过推导分组密码的非线性部分的布尔函数表达式，验证了对称加密设计与布尔函数构造之间的等价关系。

Do you know, i need you to come back

你知道吗，我需要你回来

Yang yinshu、Wang xiangsheng、Li decang,The first discovery of haemaphysalis conicinna.

1〕 杨银书，王祥生，李德昌。安徽省首次发现嗜群血蜱。