WSEAS Transactions on Mathematics
Print ISSN: 1109-2769, E-ISSN: 2224-2880
Volume 12, 2013
Linear Authentication Codes from Free Modules: Bounds and Constructions
Author:
Abstract: In this paper, we principally introduce a new class of unconditionally secure authentication codes, called linear authentication codes(or linear A-codes)from free modules. We then derive an upper bound on the size of source space when other parameters of the system, that is, the sizes of the key space and authenticator space, and the deception probability are fixed. We give constructions that are asymptotically close to the bound and show applications of these codes in constructing distributed authentication systems. We realize the generalization of linear authentication codes from vector space over field to free modules over ring.