关键词: 有限域, 射影空间, 分裂认证码

Abstract:

In traditional authentication codes,messages are determined by source state and encoding rule. However,the source state can produce more than one messages under the same encoding rule in reality. Splitting authentication codes are produced in this situation. The main focus of this research is the construction of new splitting authentication codes. Based on subspace structures from projective space over finite fields and basic counting theories,two splitting authentication codes splitting are constructed,and their size parameters are computed.Assuming that the encoding rules are chosen according to a uniform probability distribution,the probabilities of a successful impersonation and a successful substitution by the opponent are computed. Results indicate that the newly constructed codes can effectively resist the enemy爷s impersonation and substitution attack.

Key words: finite field, projective space, splitting authentication codes