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

Juan Carlos Ku-Cauich; Guillermo Morales-Luna; Horacio Tapia-Recillas

Paper 2015/618

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

Juan Carlos Ku-Cauich, Guillermo Morales-Luna, and Horacio Tapia-Recillas

Abstract

Two new systematic authentication code 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

Note: This is a new corrected and augmented version

Metadata

Available format(s): PDF
Publication info: Preprint. MINOR revision.
Keywords: Authentication schemes resilient maps Gray map
Contact author(s): jckc35 @ hotmail com
History: 2017-08-15: revised; 2015-06-30: received; See all versions
Short URL: https://ia.cr/2015/618
License: CC BY

BibTeX

@misc{cryptoeprint:2015/618,
      author = {Juan Carlos Ku-Cauich and Guillermo Morales-Luna and Horacio Tapia-Recillas},
      title = {An Authentication Code over Galois Rings with Optimal Impersonation and Substitution Probabilities},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/618},
      year = {2015},
      url = {https://eprint.iacr.org/2015/618}
}