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

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

Three Constructions of Authentication Codes with Perfect Secrecy

In this paper, we present three algebraic constructions of authentication codes with secrecy. The first and the third class are optimal. Some of the codes in the second class are optimal, and others in the second class are asymptotically optimal. All authentication codes in the three classes provide perfect secrecy.     

Constructions of projective linear codes by the intersection and difference of sets

Projective linear codes are a special class of linear codes whose dual codes have minimum distance at least 3. Projective linear codes with only a few weights are useful in authentication codes, secret sharing schemes, data storage systems and so on. In this paper, two constructions of q-ary linear codes are presented with defining sets given by the intersection and difference of two sets. These constructions produce several families of new projective two-weight or three-weight linear codes. As applications, our projective codes can be used to construct secret sharing schemes with interesting access structures, strongly regular graphs and association schemes with three classes.     

TWO NEW CONSTRUCTIONS OF CARTESIAN AUTHENTICATION CODES FROM SYMPLECTIC GEOMETRY

ＴＷＯＮＥＷＣＯＮＳＴＲＵＣＴＩＯＮＳＯＦＣＡＲＴＥＳＩＡＮＡＵＴＨＥＮＴＩＣＡＴＩＯＮＣＯＤＥＳＦＲＯＭＳＹＭＰＬＥＣＴＩＣＧＥＯＭＥＴＲＹＧＡＯＹＯＵＡＮＤＺＯＵＺＥＮＧＪＩＡ（ＤｅｐａｒｔｍｅｎｔｏｆＢａｓｉｃＳｃｉｅｎｃｅ，Ｎｏｒｔｈｅａｓｔ...     

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

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

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

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

A construction for optimal <Emphasis Type="Italic">c</Emphasis>-splitting authentication and secrecy codes

Authentication and secrecy codes which provide both secrecy and authentication have been intensively studied in the case where there is no splitting; however the results concerning the case where there is splitting are far fewer. In this paper, we focus on the case with c-splitting, and obtain a bound on the number of encoding rules required in order to obtain maximum levels of security. A c-splitting authentication and secrecy code is called optimal if it obtains maximum levels of security and has the minimum number of encoding rules. We define a new design, called an authentication perpendicular multi-array, and prove that the existence of authentication perpendicular multi-arrays implies the existence of optimal c-splitting authentication and secrecy codes. Further, we study the constructions and existence of authentication perpendicular multi-arrays, and then obtain two new infinite classes of optimal c-splitting authentication and secrecy codes.     

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

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

Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields

Two constructions of cartesian authentication codes from unitary geometry are given in this paper. Their size parameters and their probabilities of successful impersonation attack and successful substitution attack are computed. They are optimal under some cases.     

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

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

Universal hashing and authentication codes

In this paper, we study the application of universal hashing to the construction of unconditionally secure authentication codes without secrecy. This idea is most useful when the number of authenticators is exponentially small compared to the number of possible source states (plaintext messages). We formally define some new classes of hash functions and then prove some new bounds and give some general constructions for these classes of hash functions. Then we discuss the implications to authentication codes.A preliminary version of this paper was presented at CRYPTO '91 and appeared in Lecture Notes in Computer Science, vol. 576, pp. 74–85, Springer-Verlag, 1992.     

Construction of Cartesian authentication codes from unitary geometry

In the present paper several constructions of Cartesian authentication codes from unitary geometry over finite fields are presented and their size parameters are computed. Assuming that the encoding rules are chosen according to a uniform probability distribution, the probabilities P _I and P _S of a successful impersonation attack and a successful substitution attack, respectively, of these codes are also computed. Moreover, those codes so constructed, for which P _I and P _S are nearly optimal, are also determined.     

Authentication codes and bipartite graphs

In this paper, a characterization of authentication codes in terms of bipartite graphs is given. By using such a characterization, two necessary and sufficient conditions for a minimal authentication code with perfect secrecy are derived. The probabilities of a successful impersonation and of a successful substitution attack are discussed. As a result, some (optimal) minimal authentication codes with perfect secrecy are constructed from association schemes, from finite groups or from known authentication codes no matter whether the known ones are with or without secrecy.     

Singular linear space and its applications

As a generalization of attenuated spaces, the concept of singular linear spaces was introduced in [K. Wang, J. Guo, F. Li, Association schemes based on attenuated spaces, European J. Combin. 31 (2010) 297–305]. This paper first gives two anzahl theorems in singular linear spaces, and then discusses their applications to the constructions of Deza digraphs, quasi-strongly regular graphs, lattices and authentication codes.     

利用酉几何构作带仲裁的认证码

A family of authentication codes with arbitration is constructed from unitary geome-try,the parameters and the probabilities of deceptions of the codes are also computed. In a spe-cial case a perfect authentication code with arbitration is ohtalned.     

ON THE CONSTRUCTION OF AUTHENTICATION CODES THAT PERMIT ARBITRATION OVER PROJECTIVE SPACES

A family of authentication codes with arbitration are constructed over projective spaces, the parameters and the probabilities of deceptions of the codes are also computed. In a special case, a perfect authentication code with arbitration is obtained.     

各阶欺骗概率相等的最优认证码

本文研究各阶欺骗概率相等的、一般阶的最优认证码的构造。利用有限域上高次抛物线、M-序列和线性校验办法分别构造了一类保密最优认证码和两类Cartesian最优认证码。     

Authentication perpendicular arrays APA1(2, 7, ν)

Stinson introduced authentication perpendicular arrays APA_λ (t, k,ν), as a special kind of perpendicular arrays, to construct authentication and secrecy codes. In this article, we generalize the known direct and recursive constructions and show that an APA₁(2, 7, ν) exists if νodd > 9384255. We also improve the known existence result for APA₁(2, 5, ν) by presenting five new orders so that such a design exists if and only if ν ≥ 5 is odd, except &ngr: = 7 and possibly excepting ν = 9, 13, 15, 17, 33, 39, 49, 57, 63, 69, 87, 97, and 113. © 1997 John Wiley & Sons, Inc.     

A construction of fully diverse unitary space-time codes

Fully diverse unitary space-time codes are useful in multiantenna communications, especially in multiantenna differential modulation. Recently, two constructions of parametric fully diverse unitary space-time codes for three antennas system have been introduced. We propose a new construction method based on the constructions. In the present paper, fully diverse codes for systems of odd prime number antennas are obtained from this construction. Space-time codes from present construction are found to have bet...     

Difference packing arrays and systematic authentication codes

In this paper, a type of combinatorial design (called difference packing array) is proposed and used to give a construction of systematic authentication codes. Taking advantage of this construction, some new series of systematic authentication codes are obtainable in terms of existing difference packing arrays.