首页|丁广义割圆序列的线性复杂度

丁广义割圆序列的线性复杂度

扫码查看
原文链接
  • NETL
  • NSTL
  • 万方数据
Linear complexity of Ding generalized cyclotomic sequences
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.

stream ciphergeneralized cyclotomic sequencelinear complexityminimal polynomial

闫统江、陈智雄、肖国镇

展开 >

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

Department of Mathematics, Putian University, Putian 351100,P.R.China

stream cipher generalized cyclotomic sequence linear complexity minimal polynomial

国家自然科学基金福建省自然科学基金Science and Technology Fund of Educational Committee of Fujian Province

60473028A0540011JA04264

2007

上海大学学报(英文版)
上海大学

上海大学学报(英文版)

影响因子：0.196
ISSN：1007-6417
年,卷(期)：2007.11(1)
  • 3
  • 8