上海大学学报(英文版)
上海大學學報(英文版)
상해대학학보(영문판)
JOURNAL OF SHANGHAI UNIVERSITY (ENGLISH EDITION)
2007年
1期
22-26
,共5页
闫统江%陈智雄%肖国镇
閆統江%陳智雄%肖國鎮
염통강%진지웅%초국진
stream cipher%generalized cyclotomic sequence%linear complexity%minimal polynomial
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.