AbstractIn 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
In this paper, we present three algebraic constructions of authentication codes with secrecy. The co...
Authentication codes that permit arbitration are codes that unconditionally protect against deceptio...
Authentication codes that permit arbitration are codes that unconditionally protect against deceptio...
AbstractIn this paper, we present several classes of authentication codes using functions with perfe...
Authentication codes have been developed since 1974, while error correcting codes have a longer hist...
Authentication is an important issue in many communications systems. Simmons developed the theory of...
Chanson, Ding and Salomaa have recently constructed several classes of authentication codes using ce...
The authentication codes resistant to messages imitation and substitution are investigated. The case...
AbstractThere are several approaches to the construction of authentication codes without secrecy usi...
We construct two families of authentication schemes using highly nonlinear functions on finite field...
In this correspondence, the weight distribution of a class of linear codes based on perfect nonlinea...
AbstractChanson, Ding, and Salomaa have recently constructed several classes of authentication codes...
In this paper, we give several kinds of characterisations of isomorphic authentication codes by exam...
10.1109/ISIT.2006.261630IEEE International Symposium on Information Theory - Proceedings739-743PIST
AbstractIn this paper, we present three algebraic constructions of authentication codes with secrecy...
In this paper, we present three algebraic constructions of authentication codes with secrecy. The co...
Authentication codes that permit arbitration are codes that unconditionally protect against deceptio...
Authentication codes that permit arbitration are codes that unconditionally protect against deceptio...
AbstractIn this paper, we present several classes of authentication codes using functions with perfe...
Authentication codes have been developed since 1974, while error correcting codes have a longer hist...
Authentication is an important issue in many communications systems. Simmons developed the theory of...
Chanson, Ding and Salomaa have recently constructed several classes of authentication codes using ce...
The authentication codes resistant to messages imitation and substitution are investigated. The case...
AbstractThere are several approaches to the construction of authentication codes without secrecy usi...
We construct two families of authentication schemes using highly nonlinear functions on finite field...
In this correspondence, the weight distribution of a class of linear codes based on perfect nonlinea...
AbstractChanson, Ding, and Salomaa have recently constructed several classes of authentication codes...
In this paper, we give several kinds of characterisations of isomorphic authentication codes by exam...
10.1109/ISIT.2006.261630IEEE International Symposium on Information Theory - Proceedings739-743PIST
AbstractIn this paper, we present three algebraic constructions of authentication codes with secrecy...
In this paper, we present three algebraic constructions of authentication codes with secrecy. The co...
Authentication codes that permit arbitration are codes that unconditionally protect against deceptio...
Authentication codes that permit arbitration are codes that unconditionally protect against deceptio...
DOI
Add to ORKG