| 新的二元互素序列的迹表示和线性复杂度 |
| |
| 引用本文： | 闫统江,李淑清. 新的二元互素序列的迹表示和线性复杂度[J]. 计算机工程, 2010, 36(5): 137-139 |
| |
| 作者姓名： | 闫统江 李淑清 |
| |
| 作者单位： | 1. 中国石油大学数学与计算科学学院,东营,257061
2. 中国石油大学计算机与通信工程学院,东营,257061 |
| |
| 基金项目： | 国家自然科学基金资助项目(60473028);;中科院开放课题基金资助项目 |
| |
| 摘 要： | 利用周期分别为奇素数p 和q的Legendre序列构造大量新的周期为 的二元序列，根据这些序列与Legendre序列在结构上的联系，给出它们的迹表示，依据E.L. Key方法得到其线性复杂度。结果表明该类序列具有良好的符号平衡性和线性复杂度性质，作为密钥流序列可抵抗Berlekamp-Massey算法的攻击。
|
| 关 键 词： | 流密码 Legendre序列 Jacobi序列 迹表示 线性复杂度 |
| 修稿时间： | |
Trace Representations and Linear Complexity of New Binary Related-prime Sequences |
| |
| YAN Tong-jiang,LI Shu-qing. Trace Representations and Linear Complexity of New Binary Related-prime Sequences[J]. Computer Engineering, 2010, 36(5): 137-139 |
| |
| Authors: | YAN Tong-jiang LI Shu-qing |
| |
| Affiliation: | (1. College of Mathematics and Computational Science, China University of Petroleum, Dongying 257061; 2. College of Computer and Communication Engineering, China University of Petroleum, Dongying 257061) |
| |
| Abstract: | Lots of new binary sequences of period p and q are presented. These sequences are formed with the Legendre sequences with the periods p and q, where p and q are different odd primes. Based on the constructive relation of these sequences with Legendre sequences, this paper obtains the trace presentations from their defining pairs. Linear complexity is calculated by E.L. Key method. The results show that these sequences possess better properties of symbol balance and linear complexity. Used as key streams, they can resist the attack from the application of the Berlekamp-Massey algorithm. |
| |
| Keywords: | stream cipher Legendre sequences Jacobi sequences trace representations linear complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
