用有限域上迹函数构造Cartesian认证码

Constructing Cartesian authentication codes from trace functions over finite fields

通过有限域上迹函数构造了两个新的Ｃａｒｔｅｓｉａｎ认证码，计算了码参数，并在密钥均匀分布情况下计算了敌方假冒和敌方替代成功的概率．与其它现有认证码参数比较，所得码效率更高，在同等欺诈概率条件下能以同等长度密钥认证较多比特信源状态．

Two new constructions of Cartesian authentication codes are proposed from the trace functions over finite fields.Their parameters are derived,and the probabilities of success for the impersonation attack and the substitution attack by the opponent are also computed in the case of assuming that the keys are uniformly distributed.Compared with the previously best known A code ,our codes are efficient and can authenticate more source states bits with the same longth of keys.