For q = p(m) and m = 1, we construct systematic authentication codes over finite field F-q using Galois rings. We give corrections of the construction of [ 2]. We generalize corresponding systematic authentication codes of [ 6] in various ways
AbstractWe develop a theory of Gröbner bases over Galois rings, following the usual formulation for ...
Multisender authentication codes allow a group of senders to construct an authenticated message for ...
In this thesis we study a class of authentication codes with secrecy. We obtain the maximum success ...
Two new systematic authentication codes based on the Gray map over a Galois ring are introduced. The...
Two new systematic authentication codes based on the Gray map over a Galois ring are introduced. The...
Abstract A new systematic authentication scheme based on the Gray map over Galois rings is introduce...
the date of receipt and acceptance should be inserted later Abstract We introduce four constructions...
In this paper, we describe authentication codes via (generalized) Gray images of suitable codes over...
In this paper, we describe authentication codes via (generalized) Gray images of suitable codes over...
In this paper, we describe authentication codes via (generalized) Gray images of suitable codes over...
Two new systematic authentication code based on the Gray map over a Galois ring are introduced. The ...
Using additive polynomials related to some curves over finite fields, we construct two families of s...
163 p.Retirada a petición del autor 12-06-2022In 1948, Claude Shannon introduced coding theory. From...
In this paper new families of strongly universal hash functions, or equivalently, authentication cod...
In this paper new families of strongly universal hash functions, or equivalently, authentication cod...
AbstractWe develop a theory of Gröbner bases over Galois rings, following the usual formulation for ...
Multisender authentication codes allow a group of senders to construct an authenticated message for ...
In this thesis we study a class of authentication codes with secrecy. We obtain the maximum success ...
Two new systematic authentication codes based on the Gray map over a Galois ring are introduced. The...
Two new systematic authentication codes based on the Gray map over a Galois ring are introduced. The...
Abstract A new systematic authentication scheme based on the Gray map over Galois rings is introduce...
the date of receipt and acceptance should be inserted later Abstract We introduce four constructions...
In this paper, we describe authentication codes via (generalized) Gray images of suitable codes over...
In this paper, we describe authentication codes via (generalized) Gray images of suitable codes over...
In this paper, we describe authentication codes via (generalized) Gray images of suitable codes over...
Two new systematic authentication code based on the Gray map over a Galois ring are introduced. The ...
Using additive polynomials related to some curves over finite fields, we construct two families of s...
163 p.Retirada a petición del autor 12-06-2022In 1948, Claude Shannon introduced coding theory. From...
In this paper new families of strongly universal hash functions, or equivalently, authentication cod...
In this paper new families of strongly universal hash functions, or equivalently, authentication cod...
AbstractWe develop a theory of Gröbner bases over Galois rings, following the usual formulation for ...
Multisender authentication codes allow a group of senders to construct an authenticated message for ...
In this thesis we study a class of authentication codes with secrecy. We obtain the maximum success ...
DOI
Add to ORKG