|
|||||
|
|
The linear complexity of new generalized cyclotomic binary sequences of order four |
|
| Authors: | Tongjiang Yan Li Hong |
| Affiliation: | a College of Mathematics and Computational Science, China University of Petroleum, Dongying 257061, China b ISN National Key Laboratory, Xidian University, Xi’an 710071, China c College of Computer and Communication Engineering, China University of Petroleum, Dongying 257061, China |
| Abstract: | Whiteman generalized cyclotomic sequences are proven to exhibit a number of good randomness properties. In this paper we determine the linear complexity of some newly generalized cyclotomic sequences, of order four with period pq which are defined by Ding and Helleseth. The results show that all of these sequences have high linear complexity. |
| Keywords: | Stream ciphers Sequences Generalized cyclotomy Linear complexity Minimal polynomial |
| 本文献已被 ScienceDirect 等数据库收录！ | |