| 周期多序列的联合线性复杂度 |
| |
| 引用本文： | 陈智雄,谭示崇,肖国镇.周期多序列的联合线性复杂度[J].福州大学学报(自然科学版),2006,34(3):339-343. |
| |
| 作者姓名： | 陈智雄 谭示崇 肖国镇 |
| |
| 作者单位： | 1. 西安电子科技大学ISN国家重点实验室,陕西,西安,710071;莆田学院数学与应用数学系,福建,莆田,351100
2. 西安电子科技大学ISN国家重点实验室,陕西,西安,710071 |
| |
| 基金项目： | 福建省自然科学基金资助项目(项目编号:A0540011)，福建省教育厅科研资助项目(项目编号:JA04264)，莆田市科技计划资助项目(项目编号:2005S04) |
| |
| 摘 要： | 由有限域上周期多序列S与某扩域上的单序列B的对应关系,通过适当选择该扩域,使得S与B具有相同的极小多项式,从而直接应用扩域上的单序列来刻画周期多序列的联合线性复杂度和联合k-错线性复杂度等问题,把周期多序列的综合问题转化为扩域上单序列的综合问题.
|
| 关 键 词： | 流密码 周期多序列 联合线性复杂度 |
| 文章编号： | 1000-2243(2006)03-0339-05 |
| 修稿时间： | 2005年11月28 |
Joint linear complexity of periodic multi-sequences |
| |
| CHEN Zhi-xiong,TAN Shi-chong,XIAO Guo-zhen.Joint linear complexity of periodic multi-sequences[J].Journal of Fuzhou University(Natural Science Edition),2006,34(3):339-343. |
| |
| Authors: | CHEN Zhi-xiong TAN Shi-chong XIAO Guo-zhen |
| |
| Institution: | 1(1.National Key Laboratory of ISN,Xidian University,Xi’an,Shaanxi 710071,China;2.Department of Mathematics,Putian University,Putian,Fujian 351100,China) |
| |
| Abstract: | Complexity measures for sequences of elements of a finite field play an important role in cryptology.Recent developments in stream ciphers point towards an interest in word-based(or vectorized) stream ciphers,which require the study of the complexity of multi-sequences.A multi-sequence can be considered as a single sequence of elements of an extension field.We point out that a periodic multi-sequence has the same minimal polynomial,linear complexity and k-error linear complexity as its corresponding single sequence over an extension field which is chosen properly.The fact implies that in many cases the study on multi-sequences can be transferred into single-sequences. |
| |
| Keywords: | stream cipher periodic multi-sequence joint linear complexity |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《福州大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《福州大学学报(自然科学版)》下载免费的PDF全文 |
|
