A Family of Pseudorandom Binary Sequences Derived from Generalized Cyclotomic Classes Modulo p^(m+1)q^(n+1)

Xiaolin Chen ； Zhixiong Chen ； Huaning Liu

《International Journal of Network Security》 22卷4期 (2020/07) Pp. 610-620

https://doi.org/10.6633/IJNS.202007_22(4).09

摘要

Let p, q be two distinct odd primes, and let m, n be non-negative integers. We consider a family of binary sequences defined by generalized cyclotomic classes modulo p^(m+1) q^(n+1). The first contribution is to determine their linear complexity, which improves certain results of Hu, Yue and Wang. The second contribution is to compute the autocorrelation values. Results obtained indicate that such sequences are 'good' from the viewpoint of cryptography.

關鍵字

Autocorrelation Value ； Generalized Cyclotomy ； Generalized Cyclotomic Sequence ； Linear Complexity ； Stream Cipher