关键词: cartesian认证码, k-生成树, [r]阶欺骗攻击, 信息论下界

Abstract: The cartesian authentication codes based on k-spanning tree are constructed and their parameters are derived. The probabilities of success for the impersonation attack, the substitution attack and r-spoofing attack are also computed respectively based on the assumption of the encoding rules which are chosen according to a uniform probability distribution. These results extend results given by Wang Yongchuan and Yang Yixian.

Key words: cartesian authentication code, k-spanning tree, r-spoofing attack, lower bound of information theory