Class Of Authentication Codes Research Articles

Advanced approaches for information processing in multimedia, decision‐making, and security systems

Advanced approaches for information processing in multimedia, decision‐making, and security systems

AUTHENTICATION CODES FROM DIFFERENCE BALANCED FUNCTIONS

In this paper, we establish a general connection between authentication codes and difference balanced functions. Consequently, we present three new classes of authentication codes without secrecy from difference balanced functions. This is the first time that the difference balanced functions, which were used in literature mainly to construct sequences with good correlations, have been used to construct authentication codes.

Using classical groups to construct authentication codes

To design a simple and practical authentication scheme is one of the important issues in the authentication codes research.Applying partition of positive integers and Anzahl theorem of subgroups of classical groups,a class of authentication codes was obtained and all parameters of this scheme were computed.Simultaneously,supposing that the secret key was chosen according to the uniform probability distribution,security analysis of the scheme was given.The construction increased the number of the source state dramatically,which indicates that this code has better traits than some other codes obtained by matrices method before.

A Generic Construction of Cartesian Authentication Codes

In this paper, a coding-theory construction of Cartesian authentication codes is presented. The construction is a generalization of some known constructions. Within the framework of this generic construction, several classes of authentication codes using certain classes of error-correcting codes are described. The authentication codes presented in this paper are better than known ones with comparable parameters. It is demonstrated that the construction is related to certain combinatorial designs, such as difference matrices and generalized Hadamard matrices

A coding theory construction of new systematic authentication codes

There are several approaches to the construction of authentication codes without secrecy using error correcting codes. In this paper, we describe one approach and construct several classes of authentication codes using several types of error correcting codes. Some of the authentication codes constructed here are asymptotically optimal, and some are optimal.

Logarithm cartesian authentication codes

Chanson, Ding, and Salomaa have recently constructed several classes of authentication codes using certain classes of functions. In this paper, we further extend that work by constructing two classes of Cartesian authentication codes using the logarithm functions. The codes constructed here involve the theory of cyclotomy and are better than a subclass of Helleseth–Johansson’s codes and Bierbrauer’s codes in terms of the maximum success probability with respect to the substitution attack.

Cartesian authentication codes from functions with optimal nonlinearity

In this paper, we present several classes of authentication codes using functions with perfect nonlinearity and optimum nonlinearity. Some of the authentication codes are optimal. On the other hand, these authentication codes are easy to implement due to their simple algebraic structures.

Constructions of authentication codes from algebraic curves over finite fields

We present a new application of algebraic curves over finite fields to the constructions of universal hash families and unconditionally secure codes. We show that the constructions derived from the Garcia-Stichtenoth curves yield new classes of authentication codes and universal hash families which are substantially better than those previously known.

A problem of combinatorial designs related to authentication codes

The strong partially balanced t-designs can be used to construct authentication codes, whose probabilities Pr of successful deception in an optimum spoofing attack of order r for r = 0, 1, …, t − 1, achieve their information-theoretic lower bounds. In this paper a new family of strong partially balanced t-designs are constructed by means of rational normal curves over finite fields. Thus based on this new partially balanced t-designs a new class of authentication codes is obtained. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 417–429, 1998

A problem of combinatorial designs related to authentication codes

The strong partially balanced t-designs can be used to construct authentication codes, whose probabilities Pr of successful deception in an optimum spoofing attack of order r for r = 0, 1, …, t − 1, achieve their information-theoretic lower bounds. In this paper a new family of strong partially balanced t-designs are constructed by means of rational normal curves over finite fields. Thus based on this new partially balanced t-designs a new class of authentication codes is obtained. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 417–429, 1998