A Construction of Cartesian Authentication Codes from Vector Space and Dual Authentication Codes

ＡＣｏｎｓｔｒｕｃｔｉｏｎｏｆＣａｒｔｅｓｉａｎＡｕｔｈｅｎｔｉｃａｔｉｏｎＣｏｄｅｓｆｒｏｍＶｅｃｔｏｒＳｐａｃｅａｎｄＤｕａｌＡｕｔｈｅｎｔｉｃａｔｉｏｎＣｏｄｅｓＦｅｎｇＲｏｎｇｑｕａｎ（冯荣权）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ...     

Using Normal Form of Idempotent Matrices over Finite Local Ring Z/p^kZ to Construct Cartesian Authentication Codes

In this paper, we determine the normal forms of idempotent matrices for similarity over finite local rings Z/p^kZ, from which we construct a Cartesian authentication code and compute its size parameters and the probabilities of successful impersonation and substitution attack under the hypothesis that the cecoding rules are chosen according to a uniform probability distribution.     

Modelling of Ring Geometry from von Neumann’s Point of View

The idea to consider different unions of points, lines, planes, etc., is rather old. Many important configurations of such kinds are geometric (or matroidal) lattices. In this work, we study Desargues, Pappus, and Pasch configurations in D-semimodular lattices.     

Some Properties of Solutions for Some Types of Q-Difference Equations Originated from Q-Difference Painlevé Equation

In this paper, we mainly investigate some properties of meromorphic solutions for several q-difference equations, which can be seen as the q-difference analogues of Painlevé equations. Some results about the existence and the estimates of growth of meromorphic solution f for q-difference equations are obtained, especially for some estimates for the exponent of convergence of poles of ?_qf(z) := f(qz)-f(z), which extends some previous results by Qi and Yang.     

Calculus of Generalized Quasi－differentiable Functions Ⅰ：Some Results on the Space of Pairs of Convex－Set Collections

A Riesz space K1 whose elements are pairs of convex-set collections is presented for the study on the calculus of generalized quasi-differentiable functions.The space K1 is constructed by introducing a well-defined equivalence reation among pairs of collections of convex sets .Some important properties on the norm and operations is K1 are given.     

On the Construction of Some New Harmonic Maps from ℝ m to ℍ m

In this note, we construct some new harmonic maps from ℝ ^m to ℍ ^m via symmetric methods. Supportedb y NSF Postdoctoral Research Fellowship, China, and MCSEC.     

Stability of Periodic Solutions Generated by Hopf Points Emanating from a Z＿2－symmetry－breaking Takens－Bogdanov Point

Ｓｔａｂｉｌｉｔｙ　ｏｆ　Ｐｅｒｉｏｄｉｃ　Ｓｏｌｕｔｉｏｎｓ　Ｇｅｎｅｒａｔｅｄ　ｂｙ　Ｈｏｐｆ　Ｐｏｉｎｔｓ　Ｅｍａｎａｔｉｎｇ　ｆｒｏｍ　ａ　Ｚ＿２－ｓｙｍｍｅｔｒｙ－ｂｒｅａｋｉｎｇ　Ｔａｋｅｎｓ－Ｂｏｇｄａｎｏｖ　ＰｏｉｎｔＷｕＷｅｉ（吴微...     

Construction of Cartesian Authentication Codes from Pseudo Symplectic Geometry of Even Dimension

§１．ＩｎｔｒｏｄｕｃｔｉｏｎＬｅｔＳ,ＥａｎｄＭｂｅｔｈｒｅｅｎｏｎ－ｅｍｐｔｙｆｉｎｉｔｅｓｅｔｓａｎｄｌｅｔｆ：Ｓ×Ｅ→Ｍｂｅａｍａｐ．Ｔｈｅｆｏｕｒｔｕｐｌｅ（Ｓ,Ｅ,Ｍ;ｆ）ｉｓｃａｌｅｄａｎａｕｔｈｅｎｔｉｃａｔｉｏｎｃｏｄｅ（ｓｅｅ［１...     

Another Construction of Cartesian Authentication Codes from Geometry of Classical Groups

§１．ＩｎｔｒｏｄｕｃｔｉｏｎＬｅｔＳ,ＥａｎｄＭｂｅｔｈｒｅｅｎｏｎ－ｅｍｐｔｙｓｅｔｓａｎｄｌｅｔｆ：Ｓ×Ｅ→Ｍｂｅａｍａｐ．Ｔｈｅｆｏｕｒｔｕｐｌｅ（Ｓ,Ｅ,Ｍ;ｆ）ｉｓｃａｌｅｄａｎａｕｔｈｅｎｔｉｃａｔｉｏｎｃｏｄｅ（ｓｅｅ［１］）,ｉｆ（...     

利用辛几何构作两类Cartesian认证码

本文利用辛几何构作了两类 Cartesian认证码 ,计算了码的参数 .当编码规则按等概率分布选取时 ,计算出敌方成功的模仿攻击概率和成功的替换攻击概率     

利用有限域上2-幂零矩阵构作Cartesian认证码

给出 2 -幂零矩阵的Jordan标准型在相似变换下的稳定群的结构 ,利用有限域上 2 -幂零矩阵构作了一个Cartesian认证码 ,计算出了该认证码的参数 .在假定编码规则按等概率分布选取的条件下 ,计算出了该认证码被成功的模仿攻击的最大概率PI 及被成功的替换攻击的最大概率PS.     

利用有限域上伪辛几何构作两类Cartesian认证码

本文利用有限域上的伪辛几何构作了两类Cartesian认证码，并且计算了它们的参数及成功的模仿攻击概率和成功的替换攻击概率．     

利用伪辛空间上一类子空间构作d~e析取矩阵

利用伪辛空间上一类子空间m维(m,0,0,0)型子空间的性质构作了d~e析取矩阵M_q(2v+1,m,d),并利用子空间的计数定理计算了它的参数.通过研究N(m,0,0,0;2v+1)的单调性,得到了矩阵M_q(2v+1,m,d)的最优值.     

利用有限仿射几何构作Cartesian认证码

设 0 相似文献   

New Combinatorial Bounds for Authentication Codes and Key Predistribution Schemes

This paper provides new combinatorial bounds and characterizations of authentication codes (A-codes) and key predistribution schemes (KPS). We first prove a new lower bound on the number of keys in an A-code without secrecy, which can be thought of as a generalization of the classical Rao bound for orthogonal arrays. We also prove a new lower bound on the number of keys in a general A-code, which is based on the Petrenjuk, Ray-Chaudhuri and Wilson bound for t-designs. We also present new lower bounds on the size of keys and the amount of users' secret information in KPS, the latter of which is accomplished by showing that a certain A-code is hiding inside any KPS.     

利用有限域上酉几何构作两类Cartesian认证码

本文利用有限域上的酉几何构作了两类Ｃａｒｔｅｓｉａｎ认证码，并且计算了它们的参数及成功的模仿攻击概率和成功的替换攻击概率。