Design of Feedback Shift Register of Against Power Analysis Attack

Stream ciphers based on linear feedback shift register (LFSR) are suitable for constrained environments, such as satellite communications, radio frequency identification devices tag, sensor networks and Internet of Things, due to its simple hardware structures, high speed encryption and lower power consumption. LFSR, as a cryptographic primitive, has been used to generate a maximum period sequence. Because the switching of the status bits is regular, the power consumption of the LFSR is correlated in a linear way. As a result, the power consumption characteristics of stream cipher based on LFSR are vulnerable to leaking initialization vectors under the power attacks. In this paper, a new design of LFSR against power attacks is proposed. The power consumption characteristics of LFSR can be masked by using an additional LFSR and confused by adding a new filter Boolean function and a flip-flop. The design method has been implemented easily by circuits in this new design in comparison with the others.     

Boole函数的线性可分性(Ⅰ)——n-维超立方体的基本理论

Boole函数的线性可分性是前向人工神经网络理论中的一个比较困难的问题之一。目前仅对变量数n≤7的某些问题给予讨论。当n≥8时,尚无判别Boole函数线性可分的一般准则,更无线性可分Boole函数的计数公式。基于此,本文详细地研究了与Boole函数线性可分性有关的n-维超立方体的基本理论,包括n-维超立方体的基本性质、超立方体中的平行线、子超立方体的计数等,并给出了构造n-维超立方体图的一种新方法。     

Revising threshold functions

A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in terms of the resource one is interested in) is polynomial in the syntactic distance between the initial and the target concept, but only polylogarithmic in the number of variables in the universe. We give an efficient revision algorithm in the model of learning with equivalence and membership queries for threshold functions, and some negative results showing, for instance, that threshold functions cannot be revised efficiently from either type of query alone. The algorithms work in a general revision model where both deletion and addition type revision operators are allowed.     

复合布尔函数中含某单乘积项的快速判定算法

引入了布尔函数的基本积、单乘积项等概念，通过实例剖析了复合布尔函数中是否含某一单乘积项的一般判定方法，在该基础上提出了一种快速判定途径，并给出了快速判定算法的具体描述，同时对算法进行了实验，结果表明该算法快速有效。     

Peirce algebras

We present a two-sorted algebra, called aPeirce algebra, of relations and sets interacting with each other. In a Peirce algebra, sets can combine with each other as in a Boolean algebra, relations can combine with each other as in a relation algebra, and in addition we have both a set-forming operator on relations (the Peirce product of Boolean modules) and a relation-forming operator on sets (a cylindrification operation). Two applications of Peirce algebras are given. The first points out that Peirce algebras provide a natural algebraic framework for modelling certain programming constructs. The second shows that the so-calledterminological logics arising in knowledge representation have evolved a semantics best described as a calculus of relations interacting with sets.     

Convergence of iterated boolean sums of simultaneous approximants

Explicit error estimates are given for the iterated Boolean sum of a sequence of simultaneous approximants; the rate of convergence is shown to be improved for smooth functions. The general results are applied in the case of the Bernstein, Durrmeyer and Stancu operators.     

Space-time finite elements for a simplified thermo-metallurgical problem relevant to casting

The non-linear thermo-metallurgical problem, relevant for the cooling of a molten metal including the macro-segregation that occurs during the cooling process, is studied here. Due to the strong non-linearities involved in phase transformations, it is necessary to use a fine resolution in space-time in a finite element approximation in order to meet accuracy requirements. We derive space-time FE-methods based on the discontinuous and continuous Galerkin method in time for the energy equation. This formulation integrates the stored energy exactly for a given heat flux. When macro-segregation is incorporated into the model, the problem can be formulated in such a way that the phase-transition drives a flow of species. In addition, diffusion is possible throughout the domain. The model can be further rewritten using a potential approach. By this approach for modelling macro-segregation, we are able to obtain discretizations that guarantee that the balance equations are satisfied, and it is possible to solve the phase-transition problem either as a field problem or as a local problem (defined by a local evolution rule).     

关于布尔函数的二次逼近

本文首先利用矩阵形式引入了二阶ｗａｌｓｈ谱的概念并讨论了其性质，其次引入了二次ｂｅｎｔ函数的概念，同时论述了二次ｂｅｎｔ函数的密码学意义。     

多级复合布尔函数性能研究

本文研究了加法复合布尔函数和乘法复合布尔函数,在平衡性、k次项系数、K次扩散准则(PC)、相关免疫 性(CI)、Walsh谱、代数次数、小项分布等方面得到了一批新结果。     

A new approach to the decomposition of Boolean functions by the method of <Emphasis Type="Italic">q</Emphasis>-partitions. III. Joint decomposition of a function system

The paper considers the set-theoretical approach to the joint decomposition of systems of Boolean functions of variables specified in different representation forms. The approach is based on the method of q-partitions of conjuncterms and concept of decomposition clones. Theorems on joint decomposition of a system of full and partial functions are formulated. The approach is illustrated by examples. Parts I and II of this article are published in No. 5 (2001) and No. 1 (2002). __________ Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 39–58, March–April 2007.