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. Besides it is conditioned to the existence of a special class of bent maps on Galois rings.
We use cookies on our website to ensure you get the best experience. Read more about our cookies here.
RSS feed for
Preprints: The Multidisciplinary Preprint Platform
Paste the URL in your RSS reader:
https://www.preprints.org/rss
If you want to subscribe our website in subject-wide, you could find the URL by choosing in the following: