Math. Comput. Appl. 2018, 23(3), 46; https://doi.org/10.3390/mca23030046
An Authentication Code over Galois Rings with Optimal Impersonation and Substitution Probabilities
1
Computer Science, CINVESTAV-IPN, Mexico City 07360, Mexico
2
Departamento de Matemáticas, Universidad Autónoma Metropolitana-I, Mexico City 14387, Mexico
â€
Current address: Av. IPN 2508, San Pedro Zacatenco, Mexico City 07300, Mexico
‡
These authors contributed equally to this work.
*
Author to whom correspondence should be addressed.
Received: 27 July 2018 / Revised: 2 September 2018 / Accepted: 2 September 2018 / Published: 6 September 2018
Abstract
Two new systematic authentication codes 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. Additionally, it is conditioned to the existence of a special class of bent maps on Galois rings. View Full-TextKeywords:
authentication schemes; resilient maps; gray map
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Ku-Cauich, J.C.; Morales-Luna, G.; Tapia-Recillas, H. An Authentication Code over Galois Rings with Optimal Impersonation and Substitution Probabilities. Math. Comput. Appl. 2018, 23, 46.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
Article Metrics
Comments
[Return to top]
Math. Comput. Appl.
EISSN 2297-8747
Published by MDPI AG, Basel, Switzerland
RSS
E-Mail Table of Contents Alert