An Authentication Code over Galois Rings with Optimal Impersonation and Substitution Probabilities

Mathematical and Computational Applications

Tapia-Recillas, Horacio¹  Ku-Cauich, Juan Carlos²  Morales-Luna, Guillermo³ 

[1] Author to whom correspondence should be addressed.;Computer Science, CINVESTAV-IPN, Mexico City 07360, Mexico;Departamento de Matemáticas, Universidad Autónoma Metropolitana-I, Mexico City 14387, Mexico

关键词: authentication schemes;    resilient maps;    gray map;   

DOI  :  10.3390/mca23030046

学科分类：计算数学

来源: mdpi

【 摘 要 】

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.

【 授权许可】

CC BY