共查询到20条相似文献,搜索用时 0 毫秒
1.
分组密码的安全性很大程度上取决于分组密码中唯一的非线性结构S盒。论文对AES的S盒的代数性质进行分析,采用布尔函数的方法,先得到S盒的真值表,再求解S盒的布尔函数表达式,根据布尔函数表达式计算得出S盒的平衡性、正交性、线性性、差分均匀性质、鲁棒性、非线性性等代数性质,说明AES的S盒的安全性。 相似文献
2.
The concept of basic minimal paths has been introduced, and its use in deducing the node cutsets of a network was described. This 3 paper deals with two important aspects of basic minimal paths: 1) the deduction of link cutsets from node cutsets, and 2) reduction of computational requirements in deducing the basic minimal paths using network decomposition. 相似文献
3.
Aggarwal V. Calderbank A.R. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2008,54(4):1700-1707
This paper describes a fundamental correspondence between Boolean functions and projection operators in Hilbert space. The correspondence is widely applicable, and it is used in this paper to provide a common mathematical framework for the design of both additive and nonadditive quantum error correcting codes. The new framework leads to the construction of a variety of codes including an infinite class of codes that extend the original ((5, 6, 2)) code found by Rains It also extends to operator quantum error correcting codes. 相似文献
4.
5.
《IEEE transactions on circuits and systems. I, Regular papers》2006,53(10):2203-2213
As a paradigm for nonlinear spatial-temporal processing, cellular nonlinear networks (CNN) are biologically inspired systems where computation emerges from a collection of simple locally coupled nonlinear cells. Our investigation is an exploration of an important and difficult aspect of implementing arbitrary Boolean functions by using CNN. A typical class of basic key Boolean functions is the class of linearly separable ones. In this paper, we focus on establishing a complete set of mathematical theories for the linearly separable Boolean functions (LSBF) that are identical to a class of uncoupled CNN. First, we obtain an essential relationship between the template and the offset levels as well as the basis of the binary input vector set in the uncoupled CNN. More precisely, we construct a neat binary input–output truth table and some interesting properties of the offset levels of the uncoupled CNN, and develop a practical design formula for the class of CNN template. Especially, we found a criterion for LSBF, which depends only on symbolic relations between a Boolean function's outputs. Furthermore, we develop a method for representing any linearly nonseparable Boolean function into a logic operation of a sequence of linearly separable ones for a small number of inputs. 相似文献
6.
介绍了抗密码分析能力强的布尔函数的两个重要特性:平衡性和非线性,并研究了三种可产生具有高非线性的布尔函数的方法,即链接、分裂、修改序列。最后指出通过修改序列获得的平衡布尔函数比通过以往任何构造方法获得的具有更高的非线性。 相似文献
7.
《Reliability, IEEE Transactions on》2009,58(1):34-40
8.
讨论了不重复齐次k次布尔函数的密码性质,给出了这类函数所满足非线性准则;研究了这类函数在非线性组合函数的构造中的应用,得到了几个基于这类函的构造定理。 相似文献
9.
《Vehicular Technology, IEEE Transactions on》2009,58(9):4868-4877
10.
The paper describes an efficient algorithm for evaluating the minimal cut sets of any general network. The algorithm is based on Boolean algebra and set theory, and contains many important improvements. The four most important features are 1. only one set of topological input data is required to evaluate the minimal cuts and reliability indices of every output node; 2. a mix of undirectional, bidirectional and multi ended components can be included very simply; 3. any number of input nodes may be specified; 4. a new concept of overall system reliability permits different, large, and complex systems to be compared. The computational efficiency of the algorithm is clearly indicated by the fact that the time required to analyse Example 1 on a CDC7600 was 0.7 sec. The storage required with the appropriate arrays dimensioned for a system having 100 components and up to 125 minimal cut sets per output node is 15 k-words. These times and storage include the overall system reliability analysis. 相似文献
11.
2阶相关免疫函数的构造与计数 总被引:6,自引:0,他引:6
本文讨论2阶相关免疫函数的构造与计数问题,构造出了一大类重量为2的方幂的2阶相关免疫函数,首次给出了2阶相关免疫函数个数的下界。 相似文献
12.
《IEEE transactions on circuits and systems. I, Regular papers》2008,55(10):3188-3196
13.
Falkowski B.J. Shixing Yan 《IEEE transactions on circuits and systems. I, Regular papers》2007,54(8):1750-1764
The new ternary Walsh transform is considered in this paper. Such a ternary Walsh transform can be used in a similar manner as the standard Walsh transform for binary logic functions as shown here. It is based on the Kronecker product as well as the Galois field and new ternary operations. The same hardware implementation can be used for both forward and inverse ternary Walsh transforms based on its fast algorithms and properties. The ternary Walsh transform is suitable for processing both completely and incompletely specified Boolean functions. Its properties for the decomposition and symmetry detections of the Boolean functions are shown. 相似文献
14.
广义严格雪崩准则及满足它的布尔函数性质 总被引:1,自引:0,他引:1
本文从实际出发减弱了Webster和Tavares给出的严格雪崩准则(SAC)的限制条件,定义了广义严格雪崩准则,并在不作出实质性“牺牲”的前提下避免了严格雪崩准则的阶数与非线性阶之间的折衷。同时,讨论了满足广义严格雪崩准则的布尔函数性质,结果表明满足严格雪崩准则的布尔函数具有的良好性质得到了很好的继承。 相似文献
15.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》2009,55(3):1176-1205
16.
17.
18.
19.
Continuous-phase frequency shift keying (CPFSK) is discussed and theoretical predictions for symbol error probabilities are derived, where the memory inherent in the phase continuity is used to improve performance. Previously known results concluded that binary CPFSK can outperform coherently detected PSK at high SNR. New results presented here show thatM -ary CPFSK outperforms more tranditionally usedM -ary modulation systems. Specifically, coherently detected quaternary CPFSK with a five-symbol interval decision can outperform coherent QPSK by 3.5 dB, and octal coherent CPFSK with a three- symbol decision can outperform octal orthogonal signaling by 2.6 dB at high SNR. Results for coherently detected and noncoherently detected CPFSK are derived. These performance improvements are estimates derived from symbol error probability upper bounds. Monte Carlo simulation was performed which then verified the results. 相似文献
20.
The verification by Worrell & Stack (W&S) of results previously obtained by Kumamoto & Henley (K&H) for a fault tree of an s-noncoherent system and its inverse and their correction of the three errors in the tree makes it possible to simplify the analysis by forming modules; this facilitates Boolean algebraic operations, so that both sets are described economically in their minimal forms, a subset of the prime implicants (p.i.'s). Quine's consensus operation is used to minimize and to find the p.i.'s. Corresponding to the MOCUS output for the inverse reported by K&H, which is neither minimal nor the set of p.i.'s, instead of 32 terms, there are 15 in the modularized set. Instead of the 42 p.i.'s obtained by both K&H and W&S, we have 17; 13 of these are a unique minimal form. Instead of 352 p.i.'s for the tree per both K&H and W&S, we have a 15-term minimal form, identical to the list of p.i.'s. The results are further analyzed as a contribution to the continuing discussion of the utility of minimal forms vis-a-vis the p.i.'s and of the consensus method. 相似文献