New methods of construction of Cartesian authentication codes from geometries over finite commutative rings
There are problems of security communication such as confidentiality, data integrity, authentication, nonrepudiation, secret sharing and hidden information.These problems are solved by using cryptography and steganography. In [Advances in cryptology 1984, Lect. Notes Comput. Sci. 196, 411--431 (1985; Zbl 0575.94011)], \textit{G. J. Simmons} described the model of authentication code. In this paper, the authors construct some cartesian authentication codes from geometries over finite commutative rings. They only assume the uniform probability distribution over the set of encoding rules in order to be able to compute the probabilities of successful impersonation attack and substitution attack. Their methods are comfortable and secure for users, i.e., their encoding rules reduce the probabilities of successful impersonation attack and substitution attack.
scientific article; zbMATH DE number 6947343
scientific article