摘要
本文研究各阶欺骗概率相等的、一般阶的最优认证码的构造．利用有限域上高次抛物线、Ｍ－序列和线性校验办法分别构造了一类保密最优认证码和两类Ｃａｒｔｅｓｉａｎ最优认证码．
In this paper the construction of optimal authentication codes with equal cheat- ing probabilities of all orders is studied. A class of optimal secrecy-authentication codes from parabola of higher degree and two classes of optimal Cartesian authentication codes from M-sequence and linear parity over finite fields are constructed.
出处
《应用数学学报》
CSCD
北大核心
2002年第1期43-48,共6页
Acta Mathematicae Applicatae Sinica
基金
国家自然科学基金(90104034)号
广东省自然科学基金(990336号)
关键词
最优认证码
欺骗概率
高次抛物线
M-序列
线性校验
Auhentication code, cheating probability, parabola of higher degree, M-sequence, linear parity
