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.
Unable to display preview. Download preview PDF.
- T. Beth and F.C. Piper, ‘The Stop-and-Go Generator', Advances in Cryptology, Lecture Notes in Computer Science, Vol.209, pp.88–92.Google Scholar
- Kjeldsen Andresen, 'some Randomness Properties of Cascaded Sequences,’ IEEE Infor. Th. Vol IT-26 No.2, 1980.Google Scholar
- Rainer Vogel, ‘On the Linear Complexity of Cascaded Sequences', Advances in Cryptology — Proceedings of Eurocrypt'84, Lecture Notes in Computer Science, Vol.209, pp.99–109.Google Scholar
- Dieter Gollmann, ‘Pseudo Random Properties of Cascaded Connections of Clock Controlled Shift Registers', Advances in Cryptology, Lecture Notes in Computer Science, Vol.209, pp.93–98.Google Scholar
- C.G. Gunther, ‘A generator of pseudorandom sequences with clock controlled linear feedback shift registers', Presented at Eurocrypt 87, Amsterdam, Netherlands.Google Scholar
- Rainer A. Rueppel, ‘When Shift Registers Clock Themselves', Presented at Eurocrypt 87, Amsterdam, Netherlands.Google Scholar
- Cunsheng Ding, Guozhen Xiao and Weijuan Shan, ‘New Measure Index on the Security of Stream Ciphers', Northwest Telecommunication Engineering Institute, Xian, China.Google Scholar
- Cunsheng Ding, ‘Weight Complexity and Lower Bounds for the Weight Complexities of Binary Sequences with Period 2’ Unpublished.Google Scholar
- E.R. Berlekamp, ‘Algebraic Coding Theory', McGraw-Hill, New York, 1968.Google Scholar
- Rudolf Lidl, ‘Finite Fields', Encycolpedia of Mathematics and Applications, Vol.20.Google Scholar