Three constructions of perfect authentication codes from projective geometry over finite fields

Shangdi Chen and Xiaolian Zhang

Applied Mathematics and Computation, 2015, vol. 253, issue C, 308-317

Abstract: We construct perfect authentication codes from the projective geometry over finite fields. There are three major constructions. The first construction is a perfect authentication code with splitting, the second construction is a perfect authentication codes with arbitration, and the third construction is a perfect authentication code without arbitration which is an extension of the second construction. Their parameters and probabilities of successful attacks are computed.

Keywords: Authentication code; Perfect; Splitting; Arbitration; Projective geometry (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300314017494
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:253:y:2015:i:c:p:308-317

DOI: 10.1016/j.amc.2014.12.088

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().