Preprint Article Version 1 This version is not peer-reviewed

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

Version 1 : Received: 27 July 2018 / Approved: 30 July 2018 / Online: 30 July 2018 (04:26:47 CEST)

A peer-reviewed article of this Preprint also exists.

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. 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.

Journal reference: Math. Comput. Appl. 2018, 23, 46
DOI: 10.3390/mca23030046

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. Besides it is conditioned to the existence of a special class of bent maps on Galois rings.

Subject Areas

authentication schemes; resilient maps; gray map

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.