P元周期多序列及其广义对偶多序列的复杂性分析  

Joint linear complexity of periodic multi-sequences and its generalized bit-wise negative sequences over FP

作　　者：王菊香[1] 朱士信[2] 

机构地区：[1]安徽建筑工业学院数理系,合肥230601 [2]合肥工业大学数学学院,合肥230009

出　　处：《计算机应用研究》2011年第10期3831-3833,共3页Application Research of Computers

基　　金：国家自然科学基金资助项目(60973125);高校博士点基金资助项目(20080359003)

摘　　要：在提出P元周期多序列广义对偶多序列定义的基础上,讨论了P元周期多序列及其广义对偶多序列极小多项式之间的关系,研究了它们联合线性复杂度的性质。这些结果对研究流密码密钥流序列的联合线性复杂度有一定的应用价值。On base of the new definition of generalized duality multi-sequences over field FP,this paper presented the relation between the minimum polynomials of periodic multi-sequences and its generalized duality multi-sequences.Besides,it gave the properties about joint linear complexity of them.The results can be used to analyze the joint linear complexity of periodic multi-sequences of stream ciphers.

关 键 词：联合线性复杂度 极小多项式 广义对偶多序列 流密码 

分 类 号：TN918.4[电子电信—通信与信息系统]