Linear complexity of some binary interleaved sequences of period 4N
Xiao Ma, Tongjiang Yan, Daode Zhang, Yanyan Liu · International journal of network security · 2016
It is necessary that the linear complexity of a key stream sequence in a stream cipher system is not less than half of a period. This paper puts forward the linear complexity of a class of binary interleaved sequences with period 4N over the finite field with characteristic 2. Results show that the linear complexity of some of these sequences satisfies the requirements of cryptography.