首页 / 资料库 / 文献详情

Using Normal Form of Nilpotent Matrices over Finite Fields to Construct Cartesian Authentication Codes

赵辉芳、秦德生

2004东北数学：英文版Computer Science被引 1

摘要

Let Fq be a finite field. In this paper, a construction of Cartesian authentication codes from the normal form of a class of nilpotent matrices over the field Fq is presented. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the probabilities Pl and t:)8, of a successful impersonation attack and of a successful substitution attack respectively, of these codes are also computed.

引用本文（GB/T 7714）