An Authentication Code over Galois Rings with Optimal Impersonation and Substitution Probabilities
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...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-09-01
|
Series: | Mathematical and Computational Applications |
Subjects: | |
Online Access: | http://www.mdpi.com/2297-8747/23/3/46 |