计算机应用研究2011，Vol.28Issue(10)：3831-3833,3.DOI:10.3969/j.issn.1001-3695.2011.10.061
P元周期多序列及其广义对偶多序列的复杂性分析
Joint linear complexity of periodic multi-sequences and its generalized bit-wise negative sequences over FP
摘要
Abstract
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.关键词
联合线性复杂度/极小多项式/广义对偶多序列:流密码Key words
joint linear complexity/ minimum polynomial/ generalized duality multi-sequences/ stream ciphers分类
信息技术与安全科学引用本文复制引用
王菊香,朱士信..P元周期多序列及其广义对偶多序列的复杂性分析[J].计算机应用研究,2011,28(10):3831-3833,3.基金项目
国家自然科学基金资助项目(60973125) （60973125）
高校博士点基金资助项目(20080359003) （20080359003）
