基于FPGA的SM4算法高效实现方案

针对SM4算法的FPGA实现方案存在数据处理速度不够高和逻辑资源占用过高的问题,提出了基于现场可编程门阵列(FPGA)的高性能、低资源消耗的SM4算法实现方案。所提方案采用循环密钥扩展与32级流水线加解密相结合的架构,循环密钥扩展的方式降低了逻辑资源消耗,32级流水线加解密的方式提高了数据吞吐率。同时,所提方案采用代数式S盒并通过合并线性运算以及在不可约多项式的合并矩阵中筛选最优矩阵运算的方式进一步减少S盒变换的运算量,从而达到降低逻辑资源占用与提高工程数据吞吐率的目的。测试结果显示,该方案比现有最佳方案在数据吞吐率上提升了43%,且资源占用率降低了10%。

Special Relativity’s “Newtonization” in Complex “Para-Space”: The Two Theories Equivalence Question

Complex model, say C3, of “para-space” as alternative to the real M4 Minkowski space-time for both relativistic and classical mechanics was shortly introduced as reference to our previous works on that subject. The actual aim, however, is an additional analysis of the physical and para-physical phenomena’ behavior as we formally transport observable mechanical phenomena [motion] to non-real interior of the complex domain. As it turns out, such procedure, when properly set, corresponds to transition from relativistic to more classic (or, possibly, just classic) kind of the motion. This procedure, we call the “Newtonization of relativistic physical quantities and phenomena”, first of all, includes the mechanical motion’s characteristics in the C3. The algebraic structure of vector spaces was imposed and analyzed on both: the set of all relativistic velocities and on the set of the corresponding to them “Galilean” velocities. The key point of the analysis is realization that, as a matter of fact, the relativistic theory and the classical are equivalent at least as for the kinematics. This conclusion follows the fact that the two defined structures of topological vector spaces i.e., the structure imposed on sets of all relativistic velocities and the structure on set of all “Galilean” velocities, are both diffeomorphic in their topological parts and are isomorphic as the vector spaces. As for the relativistic theory, the two approaches: the hyperbolic (“classical” SR) with its four-vector formalism and Euclidean, where SR is modeled by the complex para-space C3, were analyzed and compared.

A New Formulation of Maxwell’s Equations in Clifford Algebra

A new unification of the Maxwell equations is given in the domain of Clifford algebras with in a fashion similar to those obtained with Pauli and Dirac algebras. It is shown that the new electromagnetic field multivector can be obtained from a potential function that is closely related to the scalar and the vector potentials of classical electromagnetics. Additionally it is shown that the gauge transformations of the new multivector and its potential function and the Lagrangian density of the electromagnetic field are in agreement with the transformation rules of the second-rank antisymmetric electromagnetic field tensor, in contrast to the results obtained by applying other versions of Clifford algebras.

The Monty Hall Problem and beyond: Digital-Mathematical and Cognitive Analysis in Boole’s Algebra, Including an Extension and Generalization to Related Cases

The Monty Hall problem has received its fair share of attention in mathematics. Recently, an entire monograph has been devoted to its history. There has been a multiplicity of approaches to the problem. These approaches are not necessarily mutually exclusive. The design of the present paper is to add one more approach by analyzing the mathematical structure of the Monty Hall problem in digital terms. The structure of the problem is described as much as possible in the tradition and the spirit—and as much as possible by means of the algebraic conventions—of George Boole’s Investigation of the Laws of Thought (1854), the Magna Charta of the digital age, and of John Venn’s Symbolic Logic (second edition, 1894), which is squarely based on Boole’s Investigation and elucidates it in many ways. The focus is not only on the digital-mathematical structure itself but also on its relation to the presumed digital nature of cognition as expressed in rational thought and language. The digital approach is outlined in part 1. In part 2, the Monty Hall problem is analyzed digitally. To ensure the generality of the digital approach and demonstrate its reliability and productivity, the Monty Hall problem is extended and generalized in parts 3 and 4 to related cases in light of the axioms of probability theory. In the full mapping of the mathematical structure of the Monty Hall problem and any extensions thereof, a digital or non-quantitative skeleton is fleshed out by a quantitative component. The pertinent mathematical equations are developed and presented and illustrated by means of examples.

Contractions of Certain Lie Algebras in the Context of the DLF-Theory

Contractions of the Lie algebras d = u(2), f = u(1 ,1) to the oscillator Lie algebra l are realized via the adjoint action of SU(2,2) when d, l, f are viewed as subalgebras of su(2,2). Here D, L, F are the corresponding (four-dimensional) real Lie groups endowed with bi-invariant metrics of Lorentzian signature. Similar contractions of (seven-dimensional) isometry Lie algebras iso(D), iso(F) to iso(L) are determined. The group SU(2,2) acts on each of the D, L, F by conformal transformation which is a core feature of the DLF-theory. Also, d and f are contracted to T, S-abelian subalgebras, generating parallel translations, T, and proper conformal transformations, S (from the decomposition of su(2,2) as a graded algebra T + Ω + S, where Ω is the extended Lorentz Lie algebra of dimension 7).

Solvability of Chandrasekhar’s Quadratic Integral Equations in Banach Algebra

In this paper, we prove some results concerning the existence of solutions for some nonlinear functional-integral equations which contain various integral and functional equations that are considered in nonlinear analysis. Our considerations will be discussed in Banach algebra using a fixed point theorem instead of using the technique of measure of noncompactness. An important special case of that functional equation is Chandrasekhar’s integral equation which appears in radiative transfer, neutron transport and the kinetic theory of gases [1].

Cohomology of Weakly Reducible Maximal Triangular Algebras

In this paper, we introduce the concept of weakly reducible maxi mal triangular algebras S*!which form a large class of maximal t riangular algebras. Let B be a weakly closed algebra containing S, we prove that the cohomology spaces Hn(S , B) ( n≥1) are trivial.

The Continuous Analogy of Newton’s Method for Solving a System of Linear Algebraic Equations

We propose a continuous analogy of Newton’s method with inner iteration for solving a system of linear algebraic equations. Implementation of inner iterations is carried out in two ways. The former is to fix the number of inner iterations in advance. The latter is to use the inexact Newton method for solution of the linear system of equations that arises at each stage of outer iterations. We give some new choices of iteration parameter and of forcing term, that ensure the convergence of iterations. The performance and efficiency of the proposed iteration is illustrated by numerical examples that represent a wide range of typical systems.

Two properties of sequence of vector measures on effect algebras

Let （L, ,0, 1） be an effect algebra and let X be a Banach space. A function ： L→ X is called a vector measure if μ（a b） =μ（a） ＋ μ（b） whenever a⊥b in L. The function μ is said to be 8-bounded if limn→∞μ（an） = 0 in X for any orthogonal sequence （an）n∈N in L. In this paper, we introduce two properties of sequence of s-bounded vector measures and give some results on these properties.

一种AES S盒改进方案及其硬件设计

为提高高级加密标准(advanced encryption standard, AES)算法的安全性,提出了一种新的S盒生成方案。在分析了现有S盒存在的问题后,基于S盒的构造原理和密码学性质,通过选择新的不可约多项式和仿射变换对,同时调整仿射变换与乘法逆的运算顺序,构造出一种新的S盒;对生成的新S盒与AES的S盒以及其他改进S盒在代数式项数、严格雪崩标准距离等方面进行了比较,结果显示,新S盒具有更好的代数性质,能够有效抵御代数攻击;还对新S盒进行了硬件设计并优化,DC综合结果显示新S盒复域优化实现消耗的资源比传统复域实现少12%,比查找表法实现少41%。新S盒在安全性方面优于现有S盒,将其应用于AES软件设计和硬件设计,并通过仿真测试验证了其正确性。

ALGEBRAIC EXTENSION OF *-A OPERATOR

In this paper, we study various properties of algebraic extension of ＊-A operator.Specifically, we show that every algebraic extension of ＊-A operator has SVEP and is isoloid.And if T is an algebraic extension of ＊-A operator, then Weyl＇s theorem holds for f（T）, where f is an analytic functions on some neighborhood of σ（T） and not constant on each of the components of its domain.

Algebraic Cryptanalysis of GOST Encryption Algorithm

This paper observes approaches to algebraic analysis of GOST 28147-89 encryption algorithm (also known as simply GOST), which is the basis of most secure information systems in Russia. The general idea of algebraic analysis is based on the representation of initial encryption algorithm as a system of multivariate quadratic equations, which define relations between a secret key and a cipher text. Extended linearization method is evaluated as a method for solving the nonlinear sys- tem of equations.

Shift, the Law of the Invention of Zero

After posing the axiom of linear algebra, the author develops how this allows the calculation of arbitrary base powers, which provides an instantaneous calculation of powers in a particular base such as base ten;first of all by developing the any base calculation of these powers, then by calculating triangles following the example of the “arithmetical” triangle of Pascal and showing how the formula of the binomial of Newton is driving the construction. The author also develops the consequences of the axiom of linear algebra for the decimal writing of numbers and the result that this provides for the calculation of infinite sums of the inverse of integers to successive powers. Then the implications of these new forms of calculation on calculator technologies, with in particular the storage of triangles which calculate powers in any base and the use of a multiplication table in a very large canonical base are discussed.

一种AESS盒改进方案的设计

S盒作为AES算法惟一的非线性运算,直接决定算法的性能。针对S盒的仿射变换对周期为4,迭代输出周期不大于88,而且代数表达式只有9项的缺陷提出了改进方案,并构造新的S盒。该改进S盒具有周期16仿射变换对,迭代输出周期为256,而且S盒和逆S盒代数表达式项数分别达到252项和254项。将改进的S盒与AES的S盒在平衡性、严格雪崩准则、非线性度等10种代数性质方面进行比较,结果表明改进S盒具有更好的代数性质,抗代数攻击的能力更强。

AES的S盒和逆S盒的代数表达式

利用GF(28)域中元素自身为变量表示元素分量的代数方法求解S盒和逆S盒的代数表达式,同时解释了S盒代数表达式只有9项而逆S盒代数表达式有255项的原因,此外提出了有限域下多项式幂次运算的一种快速乘方算法,实验结果表明该算法比直接乘法运算效果好。

AES S盒的分析及改进方案设计

研究了AESS盒的构造原理和主要代数性质,指出了AESS盒的仿射变换对周期为4,迭代输出周期不大于88,严格雪崩准则距离为432,代数表达式只有9项等。基于这些不足提出了构造S盒的改进方案。改进S盒的仿射变换对周期为16,迭代输出周期为256,而且S盒和逆S盒代数表达式项数均达到254项。将改进S盒与AES的S盒在平衡性、严格雪崩准则、非线性度、抗代数攻击阻力等10种代数性质上进行比较,实验结果表明改进S盒具有更好的性质。

基于AES算法中S盒的分析研究与改进

由于AES S盒代数式只有9项过于简单且仿射变换对周期和迭代输出周期过短的原因,提出了一种新的构造S盒的解决方法。该方法通过在有限域上利用拉格朗日插值公式完全展开的系数求解方法得出了S盒和逆S盒的代数式系数表。与AES S盒构造原理导出的代数式相比,该方法具有直观且简单通用的特性。MATLAB仿真结果显示,新S盒的构造时间最短。其仿射变换周期和迭代输出周期分别高达16和256。S盒和逆S盒的严格雪崩准则距离分别降为376和304。S盒的代数式项数提高到253项。表明新S盒具有更复杂的代数结构、较好的差分特性以及非线性,同时根据仿射变换次数和S盒的构造时间进一步说明新S盒的设计既简洁又高效。

关于T-S模糊系统稳定性的一个代数判据

引用一个特定的矩阵测度,基于M矩阵的基本性质,分析T S模糊系统的稳定性问题·结果表明:利用T S模糊系统子系统的系数矩阵构造一个判断矩阵,该判断矩阵的稳定性蕴涵着原T S模糊系统的全局稳定性·这个代数判据不同于现有的Lyapunov稳定性框架之下的分析结果·然后,根据PDC算法,给出一种基于该代数判据的模糊状态反馈控制器的设计方法,并给出闭环T S模糊系统判断矩阵稳定的一个必要条件·最后,通过一个数值算例说明如何利用该代数判据来设计模糊状态反馈控制器·

基于D-S证据理论直接求代数约简和代数核

针对不一致决策表,现有基于D-S证据理论的处理方法是将它先转化为一致决策表,再对所得的一致决策表计算其广义决策约简.具体算例研究表明,广义决策约简与代数约简有时并不一致.理论证明了广义决策约简仅与分配约简等价,针对不一致决策表,通过修改判断指标,提出一种基于D-S证据理论直接计算其代数约简和代数核的新方法,其正确性得到理论证明和数值算例的验证.

s代数的性质

s代数是与格上三角余模相关的一种代数.以s代数概念为基础,对其性质进行了讨论,并给出了它与其他逻辑代数间的关系,证明了s代数是一个Heyting代数.最后讨论了s代数构成BL代数的充要条件,从而为研究不同的逻辑代数以及它们之间的关系奠定了一定的理论基础.