| 多重周期序列联合线性复杂度及其快速算法 |
| |
| 引用本文： | 苏明,吴功宜. 多重周期序列联合线性复杂度及其快速算法[J]. 计算机工程, 2007, 33(9): 4-6 |
| |
| 作者姓名： | 苏明 吴功宜 |
| |
| 作者单位： | 南开大学信息技术科学学院,天津,300071 |
| |
| 摘 要： | 周期序列的线性复杂度是衡量流密码系统安全性能的一个重要指标。近几年人们注重对多重周期序列的联合线性复杂度的研究。该文给出了Fp上周期为Pn的多重周期序列联合线性复杂度的一个新的表达式，介绍了周期为Pn的随机多重周期序列联合线性复杂度分布的计算方法，提出了一种周期为Pn的多重周期序列联合线性复杂度的快速算法。
|
| 关 键 词： | 流密码系统 周期序列 线性复杂度 联合线性复杂度 快速算法 |
| 文章编号： | 1000-3428（2007）09-0004-03 |
| 修稿时间： | 2006-06-20 |
Joint Linear Complexity and Its Fast Algorithm of Multi-periodic Sequence |
| |
| SU Ming,WU Gongyi. Joint Linear Complexity and Its Fast Algorithm of Multi-periodic Sequence[J]. Computer Engineering, 2007, 33(9): 4-6 |
| |
| Authors: | SU Ming WU Gongyi |
| |
| Affiliation: | College of Information Technical Science, Nankai University, Tianjin 300071 |
| |
| Abstract: | The linear complexity of periodic sequences is one of the important security indices of stream cipher systems. Recently developments in stream ciphers point towards an interest in word-based stream ciphers, which require the study of the joint linear complexity of multi-sequences. This paper gives a new calculation method to compute the joint linear complexity of random Pn-periodic sequences over Fp. A new fast algorithm for computing the joint linear complexity of Pn-periodic sequences over Fp is proposed. |
| |
| Keywords: | Stream cipher system Periodic sequence Linear complexity Joint linear complexity Fast algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
