New methods of construction of Cartesian authentication codes from geometries over finite commutative rings
type: Item
instance of: scholarly article
title: New methods of construction of Cartesian authentication codes from geometries over finite commutative rings
zbMATH Open document ID: 1435.94133
author: Wachirapong Jirakitpuwapat
author: Parin Chaipunya
author: Poom Kumam
author: S. Dhompongsa
author: Phatiphat Thounthong
published in: Journal of Mathematical Cryptology
publication date: 2018-10-04T00:00:00Z
review text: 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.
reviewed by: Nan Ji-Zhu
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 51E26
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 6947343
zbMATH Keywords: authentication code
zbMATH Keywords: finite commutative ring
zbMATH Keywords: geometry of classical groups
MaRDI profile type: Publication
full work available at URL: jmc-2017-0057
OpenAlex ID: W2809670899
cites work: Q5563439
cites work: Q4548814
cites work: Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields
cites work: Q4549005
cites work: Authentication codes and bipartite graphs
cites work: Q4343045
cites work: Q4716408
cites work: Two new constructions of Cartesian authentication codes from symplectic geometry
cites work: Codes Which Detect Deception
cites work: Q4698439
cites work: Q4745961
cites work: A CONSTRUCTION OF CARTESIAN AUTHENTICATION CODE FROM ORTHOGONAL SPACES OVER A FINITE FIELD OF ODD CHARACTERISTIC
cites work: A generalization of the formulas for intersection numbers of dual polar association schemes and their applications
cites work: Symplectic graphs over finite commutative rings
cites work: Orthogonal graphs over finite commutative rings of odd characteristic
cites work: Structure of unitary groups over finite group rings and its application
cites work: A Mathematical Theory of Communication
cites work: Authentication Theory/Coding Theory
cites work: Logarithm Cartesian authentication codes.
cites work: Linear authentication codes: bounds and constructions
Wikidata QID: Q129627056
DOI: 10.1515/JMC-2017-0057
description: scientific article; zbMATH DE number 6947343