摘要
利用集合论构造了一个Cartesion认证码 ,并计算了码参数 ,敌方假冒、替换成功的概率和r阶欺骗成功的概率 ,并推广了王永传。
A new construction of cartesion authentication codes is proposed from the set knowledge. Their parameters are derived, and the probabilities of success for the impersonation attack, the substitution attack and order r spoofing attack by the opponent are also computed. These results extend the theorem given in 1997 by Wang Yongchuan and Yang Yixian.
出处
《怀化学院学报》
2004年第2期17-19,共3页
Journal of Huaihua University