首页 | 本学科首页   官方微博 | 高级检索  
     

P元周期多序列及其广义对偶多序列的复杂性分析*
引用本文:王菊香,朱士信. P元周期多序列及其广义对偶多序列的复杂性分析*[J]. 计算机应用研究, 2011, 28(10): 3831-3833. DOI: 10.3969/j.issn.1001-3695.2011.10.061
作者姓名:王菊香  朱士信
作者单位:1. 安徽建筑工业学院数理系,合肥,230601
2. 合肥工业大学数学学院,合肥,230009
基金项目:国家自然科学基金资助项目(60973125); 高校博士点基金资助项目(20080359003)
摘    要:在提出P元周期多序列广义对偶多序列定义的基础上,讨论了P元周期多序列及其广义对偶多序列极小多项式之间的关系,研究了它们联合线性复杂度的性质。这些结果对研究流密码密钥流序列的联合线性复杂度有一定的应用价值。

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

Joint linear complexity of periodic multi-sequences and its generalized bit-wise negative sequences over FP
WANG Ju-xiang,ZHU Shi-xin. Joint linear complexity of periodic multi-sequences and its generalized bit-wise negative sequences over FP[J]. Application Research of Computers, 2011, 28(10): 3831-3833. DOI: 10.3969/j.issn.1001-3695.2011.10.061
Authors:WANG Ju-xiang  ZHU Shi-xin
Affiliation:WANG Ju-xiang1,ZHU Shi-xin2(1.Dept.of Mathematics & Physicss,Anhui University of Architecture,Hefei 230601,China,2.School of Mathematics,Hefei University of Technology,Hefei 230009,China)
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.
Keywords:joint linear complexity  minimum polynomial  generalized duality multi-sequences  stream ciphers  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号