On the Linear Complexity of Ding-Helleseth Generalized Cyclotomic Binary Sequences of Order Four and Six

Vladimir Edemskiy, Olga Antonova


We propose a new computation method for the linear complexity and the minimal polynomial of Ding-Helleseth-generalized cyclotomic sequences. We will nd the linear complexity of Ding-Helleseth-generalized cyclotomic sequences of order four and six and make the results of Tongjiang Yan et al about the sequences of order four more specic.


Stream ciphers; sequences; generalized cyclotomy; linear complexity; minimal polynomial

Full Text: