Preprint Article Version 2 Preserved in Portico This version is not peer-reviewed

Three authentication schemes without secrecy over finite fields and Galois rings

Version 1 : Received: 25 January 2021 / Approved: 26 January 2021 / Online: 26 January 2021 (13:25:14 CET)
Version 2 : Received: 24 March 2021 / Approved: 25 March 2021 / Online: 25 March 2021 (16:00:52 CET)

How to cite: Ku-Cauich, J.C.; Márquez-Hidalgo, M.A. Three authentication schemes without secrecy over finite fields and Galois rings. Preprints 2021, 2021010540. https://doi.org/10.20944/preprints202101.0540.v2 Ku-Cauich, J.C.; Márquez-Hidalgo, M.A. Three authentication schemes without secrecy over finite fields and Galois rings. Preprints 2021, 2021010540. https://doi.org/10.20944/preprints202101.0540.v2

Abstract

We give 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 given 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 bring a better relationship between the size of the message space and the key space than the given in [8]. Finally, we provide a third scheme on Galois rings, which generalizes the scheme over finite fields constructed in [9].

Keywords

Authentication Schemes; Resilient functions; Gray map

Subject

Computer Science and Mathematics, Algebra and Number Theory

Comments (1)

Comment 1
Received: 25 March 2021
Commenter: Juan Carlos Ku-Cauich
Commenter's Conflict of Interests: Author
Comment: We fixed errors in writing, abstract, introduction, and keywords
+ Respond to this comment

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)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 1
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.