New methods of construction of cartesian authentication codes from geometries over finite commutative rings

Journal article

Authors/Editors

Strategic Research Themes

No matching items found.

Publication Details

Author list: Jirakitpuwapat W., Chaipunya P., Kumam P., Dhompongsa S., Thounthong P.

Publisher: De Gruyter

Publication year: 2018

Volume number: 12

Issue number: 3

Start page: 119

End page: 136

Number of pages: 18

ISSN: 1862-2976

eISSN: 1862-2976

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85049216497&doi=10.1515%2fjmc-2017-0057&partnerID=40&md5=9581e9479387e3950b0096e84d09e48d

Languages: English-Great Britain (EN-GB)

View in Web of Science | View on publisher site | View citing articles in Web of Science

Abstract

In this paper, we construct some cartesian authentication codes from geometries over finite commutative rings. We 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. Our methods are comfortable and secure for users, i.e., our encoding rules reduce the probabilities of successful impersonation attack and substitution attack. ฉ 2018 Walter de Gruyter GmbH, Berlin/Boston.

Keywords

Authentication code, finite commutative ring, geometry of classical groups