|
|||||
|
|
| 丁广义割圆序列的线性复杂度 | |
| 引用本文： | 闫统江,陈智雄,肖国镇.丁广义割圆序列的线性复杂度[J].上海大学学报(英文版),2007,11(1):22-22. |
| 作者姓名： | 闫统江 陈智雄 肖国镇 |
| 作者单位： | ISN National Key Laboratory Xidian University，ISN National Key Laboratory Xidian University，ISN National Key Laboratory Xidian University Xi'an 710071，P.R.China College of Mathematics and Computation Science，China University of Petroleum，Dongying 257061，P.R.China，Xi'an 710071，P.R.China Department of Mathematics，Putian University，Putian 351100，P.R.China，Xi'an 710071，P.R.China |
| 基金项目： | 国家自然科学基金;福建省自然科学基金 |
| 摘 要： | Minimal polynomials and linear complexity of binary Ding generalized cyclotomic sequences of order 2 with the two-prime residue ring Zpq are obtained by Bai in 2005. In this paper, we obtain linear complexity and minimal polynomials of all Ding generalized cyclotomic sequences. Our result shows that linear complexity of these sequences takes on the values pq and pq-1 on our necessary and sufficient condition with probability 1/4 and the lower bound （pq - 1）/2 with probability 1/8. This shows that most of these sequences are good. We also obtained that linear complexity and minimal polynomials of these sequences are independent of their orders. This makes it no more difficult in choosing proper p and q. |
| 关 键 词： | 丁广义割圆序列 线性复杂度 多项式 随机序列 |
| 收稿时间： | 2005-09-27 |
| 修稿时间： | 2006-05-08 |
Linear complexity of Ding generalized cyclotomic sequences |
|
| YAN Tong-jiang,CHEN Zhi-xiong,XIAO Guo-zhen.Linear complexity of Ding generalized cyclotomic sequences[J].Journal of Shanghai University(English Edition),2007,11(1):22-22. | |
| Authors: | YAN Tong-jiang CHEN Zhi-xiong XIAO Guo-zhen |
| Institution: | 1. ISN National Key Laboratory, Xidian University, Xi'an 710071, P. R. China;College of Mathematics and Computation Science, China University of Petroleum, Dongying 257061, P. R. China 2. ISN National Key Laboratory, Xidian University, Xi'an 710071, P. R. China;Department of Mathematics, Putian University, Putian 351100,P.R.China 3. ISN National Key Laboratory, Xidian University, Xi'an 710071, P. R. China |
| Abstract: | Minimal polynomials and linear complexity of binary Ding generalized cyclotomic sequences of order 2 with the two-prime residue ring Z_(pq)are obtained by Bai in 2005.In this paper,we obtain linear complexity and minimal polynomials of all Ding generalized cyclotomic sequences.Our result shows that linear complexity of these sequences takes on the values p q and p q-1 on our necessary and sufficient condition with probability 1/4 and the lower bound(pq-1)/2 with probability 1/8.This shows that most of these sequences are good.We also obtained that linear complexity and minimal polynomials of these sequences are independent of their orders.This makes it no more difficult in choosing proper p and q. |
| Keywords: | stream cipher generalized cyclotomic sequence linear complexity minimal polynomial |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ | |
| 点击此处可从《上海大学学报(英文版)》浏览原始摘要信息 | |
| 点击此处可从《上海大学学报(英文版)》下载免费的PDF全文 | |