论文信息 - Lower Bounds on the Weight Complexities of Cascaded Binary Sequences

Lower Bounds on the Weight Complexities of Cascaded Binary Sequences

The stability of linear complexity of sequences is a basic index for measuring the quality of the sequence when employed as a key stream of a stream cipher. Weight complexity is such a quantity which can be used to measure the stability of a sequence. Lower bounds on the weight complexities of a kind of cascaded binary sequences are presented in this correspondence.

Cunsheng Ding | C. Ding

[1] Kjell Kjeldsen,et al. Some randomness properties of cascaded sequences (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[2] D. Gollman. Pseudo random properties of cascade connections of clock controlled shift registers , 1985 .

[3] Thomas Beth,et al. The Stop-and-Go Generator , 1985, EUROCRYPT.

[4] Rainer A. Rueppel,et al. When Shift Registers Clock Themselves , 1987, EUROCRYPT.

[5] Rainer Vogel,et al. On the Linear Complexity of Cascaded Sequences , 1985, EUROCRYPT.

[6] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.