An Authentication Code over Galois Rings with Optimal Impersonation and Substitution Probabilities
نویسندگان
چکیده
منابع مشابه
An Authentication Code over Galois Rings with Optimal Impersonation and Substitution Probabilities
Two new systematic authentication code based on the Gray map over a Galois ring are introduced. The first introduced code attains optimal impersonation and substitution probabilities. The second code improves space sizes but it does not attain optimal probabilities. Besides it is conditioned to the existence of a special class of bent maps on Galois rings.
متن کاملAuthentication codes based on resilient Boolean maps
We introduce new constructions of systematic authentication codes over finite fields and Galois rings. One code is built over finite fields using resilient functions and it provides optimal impersonation and substitution probabilities. Other two proposed codes are defined over Galois rings, one is based on resilient maps and it attains optimal probabilities as well, while the other uses maps wh...
متن کاملProof of Correspondence between Keys and Encoding Maps in an Authentication Code
Systematic authentication codes without secrecy were defined in [1]. In [2] two new systematic authentication codes based on the Gray map on a Galois ring are introduced with the purpose of optimally reducing the impersonation and substitution probabilities. The first code is another example of a previously constructed code using the Gray map on Galois rings and modules over these rings [3,4]. ...
متن کاملSkew constacyclic codes over Galois rings
We generalize the construction of linear codes via skew polynomial rings by using Galois rings instead of finite fields as coefficients. The resulting non commutative rings are no longer left and right Euclidean. Codes that are principal ideals in quotient rings of skew polynomial rings by a two sided ideals are studied. As an application, skew constacyclic self-dual codes over GR(4) are constr...
متن کاملQuantum Fourier Transform over Galois Rings 1
Galois rings are regarded as “building blocks” of a finite commutative ring with identity. There have been many papers on classical error correction codes over Galois rings published. As an important warm-up before exploring quantum algorithms and quantum error correction codes over Galois rings, we study the quantum Fourier transform (QFT) over Galois rings and prove it can be efficiently pref...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computational Applications
سال: 2018
ISSN: 2297-8747
DOI: 10.3390/mca23030046