关键词: 认证码, 典型群, 有限域, 无序分拆, 密钥

Abstract: To design a simple and practical authentication scheme is one of the important issues in the authentication codes research. Applying partition of positive integers and Anzahl theorem of subgroups of classical groups, a class of authentication codes was obtained and all parameters of this scheme were computed. Simultaneously, supposing that the secret key was chosen according to the uniform probability distribution, security analysis of the scheme was given. The construction increased the number of the source state dramatically, which indicates that this code has better traits than some other codes obtained by matrices method before.

Key words: authentication codes, classical group, finite field, partition, secret key