Paper 2014/547

Authentication Codes Based on Resilient Boolean Maps

Juan Carlos Ku-Cauich and Guillermo Morales-Luna


We introduce new constructions of systematic authentication codes over finite fields and Galois rings. One code is built over finite fields using resilient functions and it provides optimal impersonation and substitution probabilities. Other two proposed codes are defined over Galois rings, one is based on resilient maps and it attains optimal probabilities as well, while the other uses maps whose Fourier transforms get higher values. Being the finite fields special cases of Galois rings, the first code introduced for Galois rings apply also at finite fields. For the special case of characteristic $p^2$, the maps used at the second case in Galois rings are bent indeed, and this case is subsumed by our current general construction of characteristic $p^s$, with $s\geq 2$.

Note: This paper was sent to Design, Codes and Cryptography, we are waiting the possible acceptance.

Available format(s)
Secret-key cryptography
Publication info
Preprint. MINOR revision.
message authentication codes
Contact author(s)
jckc35 @ hotmail com
2015-02-23: revised
2014-07-18: received
See all versions
Short URL
Creative Commons Attribution


      author = {Juan Carlos Ku-Cauich and Guillermo Morales-Luna},
      title = {Authentication Codes Based on Resilient Boolean Maps},
      howpublished = {Cryptology ePrint Archive, Paper 2014/547},
      year = {2014},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.