Linear authentication codes over finite local rings

Gao Yo · Journal of Natural Science of Heilongjiang University · 2013

Linear authentication codes over finite local rings are considered. Linearity requires some additional algebraic properties for the A-codes. When the sizes of the key space,the authenticator space, and the deception probability are fixed,an upper bound on the size of source space is computed. It is also given an application about linear authentication codes in constructing authentication codes with arbitration.

Read the paper · More papers on PaperTik