boolean (function) 中文意思是什麼

On the other hand, it is expressible as a boolean expression if you accept including function calls in the boolean expression

但換個角度，如果你允許在布爾表達式中植入包含函數調用，則它就是一個布爾表達式可表述的屬性。

It can give bdd presentation of boolean function or arbitrary combination logic circuits which are presented by cdl, and can realize different operation of boolean function by the operation to bdd

能完成對任意基於cdl語言描述的組合邏輯電路或布爾函數，實現其bdd表示並通過對bdd的操作實現對相應組合電路或布爾函數的操作。

According to the principle of generation of prime number through boolean algebra logic operation and phase angle matrix analysis of the periodic function it comes out that any even number larger than 4 can be expressed as the sum of two prime numbers ��� i. e. ��� 1 + 1 ��� is tenable, and thereby finishes demonstration of the validity of goldbach ' s conjecture

根據素數的形成機理，從布爾代數的邏輯運算和周期函數的相角矩陣分析，都得出了大於4的任何偶數都可表示成兩個素數之和即「 1 + 1 」成立，從而完成了哥德巴赫猜想成立的論證。

The element - available ( ) function returns a boolean value that indicates whether the element specified is supported by the xslt processor

函數的作用是：返回一個邏輯值，用於指定xslt處理器是否允許支持指定的元素。

An investigation of the rijndael algorithm which is the advanced encryption standard of usa is taken in this thesis. we have focused on developing the cryptographic properties of the rijndael sbox from the viewpoint of boolean function, walsh spectrum and algebraic structures, on the attacks against the reduced variants of rijndael, and on the optimized implementations of rijndael. the key contributions follow below

本文對美國高級加密標準rijndael演算法進行了比較深入的研究，內容包括：從布爾函數、 walsh譜和代數結構的角度對其s盒密碼性質進行的研究，簡化演算法的攻擊方法以及演算法的優化實現問題，主要成果有： 1 、提出求解布爾函數表達式的兩種新方法，具有簡潔、易於編程實現、準確而快速的特點，應用於des演算法獲得與公開文獻相符的結果，應用於rijndael演算法首次求出其s盒布爾函數表達式。

Using the theories of probability, algebra and number theory comprehensively, we investigate a class of boolean functions with three - valued walsh spectrum in the first part of this dissertation : the properties of the extended semi - bent functions, which are constructed from any two bent functions, are studied, followed by the structure characteristics of the boolean functions satisfying propagation criterion with respect to all but two vectors ; the definition and cryptographic properties of k - order quasi - bent functions are proposed whose walsh spectrum takes on only three values. some sufficient and necessary conditions are offered to decide whether a boolean function is a k - order quasi - bent function ; a special method is presented to construct the k - order quasi - bent functions, whose cryptographic properties are explored by the matrix method, which is different from the method of walsh spectrum and that of autocorrelation of boolean functions ; the application of this kind of boolean functions in the fields of stream cipher, communications and block ciphers is discussed, which shows the great importance of the fc - order quasi - bent functions ; some methodology are proposed to construct the k - order quasi - bent functions, including the complete construction by using the characteristic matrices of boolean functions, and the recursive method by two known k - order quasi - bent functions we further extend our investigation to the ring zp, where p is a prime, and the similar results are presented as far as the p - valued quasi - generalized - bent functions are considered

本文首先綜合運用概率論、代數學、數論等基礎學科的理論知識，並以頻譜理論作為主要研究工具，對一類譜值分佈相對均勻的函數? ?廣半bent函數、 k階擬bent函數和p值k階擬廣義bent函數進行了系統、深入的研究，給出了廣半bent函數定義，並探討了廣半bent函數的密碼學性質；給出了k階擬bent函數和p值k階擬廣義bent函數的定義及等價判別條件；討論了k階擬bent函數和p值k階擬廣義bent函數與部分bent函數和p值廣義部分bent函數的關系，探討了它們的密碼學性質；給出了k階擬bent函數和p值k階擬廣義bent函數的典型構造方法，並將對k階擬bent函數的密碼性質的研究轉化到對一類特殊的矩陣的研究上；利用布爾函數的特徵矩陣原則上給出了k階擬bent函數的一種完全構造方法，還給出了從已有的p值k階擬廣義bent函數出發，遞歸構造變元個數更多的p值k階擬廣義bent函數的方法；初步探討了k階擬bent函數在序列密碼、分組密碼以及通信中的應用；給出了一類布爾函數walsh譜的分解式，並利用這類布爾函數的walsh譜分解式給出了一類近似穩定的布爾函數的構造，特殊情形下為k階擬bent函數；利用代數數論的知識考察了p值k階擬廣義bent函數的譜特徵，並給出了k階擬廣義bent函數與所有仿射函數的符合率特徵等等。

For example nonlinearity, algebraic degree, correlation immunity, etc. basing on the method of hill climbing and the properties of boolean function, an algorithm, which is better than hc algorithm, named ihc is gave out to improve the design of nonlinearity of boolean functions. by analyzing the output and input sequences of a nonlinear combined generator, we also give out an algorithm ( lhc ) to evolve the correlation from a random function to a very lower one

本文研究了hillclimbing演算法以及布爾函數非線性度的性質，對hillclimbing演算法進行改進，提高了該方法下對布爾函數非線性度的優化設計;通過研究非線性組合生成器中驅動序列和輸出序列之間的關系，基於hillclimbing方法，本文進一步提出了改善非線性組合序列相關性指標（ f ）的組合函數f （ x ）的優化設計演算法lhc 。

In this paper, the general structure of block cipher together with its related properties is firstly discussed, then the main non - linear component of s - boxes in block cipher is analyzed. as to the boolean function in binary field, we studied its non - linearity, linearity structure, output bit independence criterion ( big ), balance, completeness, strict avalanche criterion, propagation criterion, correlation immunity, linear approximation table and xor distribution table. we also discussed the pile - up lama used to compute the combination linear probability and showed an instance of its application

本文首先討論了分組密碼的一般結構及其相關特性，此外還有分組密碼主要的非線性組成部分s盒。對於二元域上的布爾函數主要討論了其非線性性、線性結構、比特獨立準則、平衡性、完整性、雪崩準則、傳播準則、相關免疫性、線性分佈表及異或分佈表等特性。對計算組合線性概率的迭加定理我們也進行了具體的討論，並給出了運用事例。

Finally, their applications in the logic synthesis based on the partial linear function and calculating boolean difference of logical functions are discussed

最後討論了它們在邏輯綜合以及計算邏輯函數的布爾差分中的應用。

For multi - output boolean functions, we give out the definition of correlation permissibility. by investigating some properties of the balanced multi - output boolean functions, a feasible strategy of evolvement of function is presented. based on the method of simulated annealing and using the strategy presented in the 3rd section of capter four, a method is described to tell us how we can get some multi - output boolean functions with low correlation permissibility and high nonlinearity

對于多輸出布爾函數，本文提出了相關容許度的概念，針對平衡的多輸出布爾函數，研究了這類函數的分量函數之間的關系和性質，在不改變部分分量函數的情況下，分析了相鄰函數演化的可行性和演化策略，基於simulatedannealing演算法，本文分別提出了具有高非線性度的一階相關免疫平衡函數的優化設計演算法，以及具有高非線性度和低相關容許度的布爾函數或多輸出布爾函數的優化設計演算法。

When calculate the correlation function of binary array pairs, using the boolean calculation instead of the decimal multiplication, using the method of count the number of 1 in binary integer to calculate the correlation function of binary array pairs, the speed of searching is obviously improved by these methods. by the algorithm introduced in this paper, the constant weight and normative perfect binary array pairs whose volume from 4 to 28 and quasi - perfect binary array pairs whose volume from 2 to 24 were searched and gi ved the new result

此外，採用二進制整數來表示陣列，通過對整數的邏輯運算來實現陣列偶的移位變換、完全采樣變換等運算；在計算二進陣列偶的相關函數時，用整數的邏輯運算代替十進制中的乘法運算，並用計算二進制整數中1的個數的方法來計算二進陣列偶的相關函數，以上方法的採用明顯地提高了搜索速度。利用上述演算法，對體積為4 28的等重規范型最佳二進陣列偶和體積為2 24的準最佳二進陣列偶進行了搜索，並給出了新的結果。

The standard expansions of an arbitrary logic function in these complete sets from the rm, crm are deduced, and two examples are proposed to discuss the relation between the expansions in boolean subtraction - xor, division - coincidence algebraic systems and the expansions in and - or - not algebraic system

舉例說明了與-或-非代數系統中規范中規范展開式與布爾減-異或、布爾除-符合代數系統中的規范展開式之間的轉換。

3. the only non - linear part of the algorithm ? s - box is researched in the view of multi - output boolean function, and the algebraic expression and boolean function expression of the s - box are obtained. after analyzing a series of the cipher properties of the s - box, the inner course that camellia could be chosen as european block cipher standard and could withstand many attack ways effectively is revealed

3 .從多輸出布爾函數這一角度對此演算法中唯一的非線性部件? s盒進行了研究，得出了s盒的代數表達式和布爾函數表達式，並通過對s盒的一系列密碼性質的分析，揭示了camellia演算法被選為歐洲普通型分組密碼標準並能抵抗多種攻擊方法的內在原因。

Uses node - sets as arguments for boolean function

把節點集作為boolean函數的參數。

1. two new approaches to determine the algebraic representation of a boolean function are proposed with their applications on the des and rijndael sboxes. 2. based on the theory of walsh spectrum, such properties as linearity, strict avalanche, propagation and correlation immunity are analysed

2 、利用walsh譜理論分析rijndael演算法s盒的線性性、非線性性、嚴格雪崩特性、擴散特性和相關免疫性等密碼性質，從理論上揭示其安全性。

On decision tree complexity of boolean function and yao ' s question

布爾函數的判定樹復雜性及問題

Strings are arguments of boolean function

中，函數boolean的參數是字元串。

Is text transformed into numbers and then subjected to boolean function

把文字轉換為數字再傳給boolean函數。

A heuristic algorithm for obtaining balanced boolean function satisfying high nonlinearity

一種獲得高非線性平衡布爾函數的啟發式演算法

Information and computation, 1992, 98 : 142 - 170. 6 bryant r e. graph - based algorithms for boolean function manipulation

同時狀態轉換的計算可以以集合為單位，提供了搜索的效率。