About the Linear Complexity of Ding-Hellesth Generalized Cyclotomic Binary Sequences of Any Period

This work addresses the problem of designing secure pseudorandom sequences for cryptography, but it appears incremental as it builds on existing Ding-Helleseth sequences.

The paper tackles the design of Ding-Helleseth sequences with arbitrary period and high linear complexity for generalized cyclotomies, establishing sufficient conditions and a method for computing linear complexity in general cases.