Analysis of \((k_ 0,k_ 1)\) clock-controlled sequences (Q1842605)

The paper deals with nets of feedback shift-registers in which a linear shift-register is clock controlled in a pseudorandom manner by another register. The necessary and sufficient condition for the maximal linear complexity and the maximal period of the sequences generated by such nets are given and statistical properties are discussed. Because of weaknesses in the security of the cryptographic system two kinds of improved models having better statistical properties are proposed. The authors analyse the ability of the new nets of resisting the algebraic attacks.