An approach to construct feedforward clock-controlled sequence with high linear complexity

In practical applications, people tend to use feedforward clock control structures to construct stream ciphers. However, it is difficult to estimate the linear complexity lower bound for stream ciphers constructed in this way. This paper proposes a clock-controlled sequence construction method with provably high linear complexity. For a control sequence with period m, the complexity of proof is O(m2), independent of the controlled sequence period size. 1