Three Authentication Schemes without Secrecy over Finite Fields and Galois Rings

Juan Carlos Ku-Cauich and Miguel Angel Márquez-Hidalgo
Additional contact information
Juan Carlos Ku-Cauich: Computer Science, CINVESTAV-IPN, Mexico City 07360, Mexico
Miguel Angel Márquez-Hidalgo: Computer Science, CINVESTAV-IPN, Mexico City 07360, Mexico

Mathematics, 2021, vol. 9, issue 9, 1-15

Abstract: We provide three new authentication schemes without secrecy. The first two on finite fields and Galois rings, using Gray map for this link. The third construction is based on Galois rings. The main achievement in this work is to obtain optimal impersonation and substitution probabilities in the schemes. Additionally, in the first and second scheme, we simplify the source space and obtain a better relationship between the size of the message space and the key space than the one given in a recent paper. Finally, we provide a third scheme on Galois rings.

Keywords: authentication schemes; resilient functions; Gray map (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/9/9/942/pdf (application/pdf)
https://www.mdpi.com/2227-7390/9/9/942/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:9:y:2021:i:9:p:942-:d:542022

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().