Title of article
The linear complexity of new generalized cyclotomic binary sequences of order four
Author/Authors
Tongjiang Yan، نويسنده , , Li Hong، نويسنده , , Guozhen Xiao، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
9
From page
807
To page
815
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
sequences , Stream ciphers , Generalized cyclotomy , Minimal polynomial , Linear complexity
Journal title
Information Sciences
Serial Year
2008
Journal title
Information Sciences
Record number
1213213
Link To Document