Abstract
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.
This work is one part of the research of the Stability of Stream Ciphers supported by the Chinese Natural Science Foundation under No.6882007.
Preview
Unable to display preview. Download preview PDF.
References
T. Beth and F.C. Piper, ‘The Stop-and-Go Generator', Advances in Cryptology, Lecture Notes in Computer Science, Vol.209, pp.88–92.
Kjeldsen Andresen, 'some Randomness Properties of Cascaded Sequences,’ IEEE Infor. Th. Vol IT-26 No.2, 1980.
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.
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.
C.G. Gunther, ‘A generator of pseudorandom sequences with clock controlled linear feedback shift registers', Presented at Eurocrypt 87, Amsterdam, Netherlands.
Rainer A. Rueppel, ‘When Shift Registers Clock Themselves', Presented at Eurocrypt 87, Amsterdam, Netherlands.
Cunsheng Ding, Guozhen Xiao and Weijuan Shan, ‘New Measure Index on the Security of Stream Ciphers', Northwest Telecommunication Engineering Institute, Xian, China.
Cunsheng Ding, ‘Weight Complexity and Lower Bounds for the Weight Complexities of Binary Sequences with Period 2’ Unpublished.
E.R. Berlekamp, ‘Algebraic Coding Theory', McGraw-Hill, New York, 1968.
Rudolf Lidl, ‘Finite Fields', Encycolpedia of Mathematics and Applications, Vol.20.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ding, C. (1990). Lower bounds on the weight complexities of cascaded binary sequences. In: Seberry, J., Pieprzyk, J. (eds) Advances in Cryptology — AUSCRYPT '90. AUSCRYPT 1990. Lecture Notes in Computer Science, vol 453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030350
Download citation
DOI: https://doi.org/10.1007/BFb0030350
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53000-8
Online ISBN: 978-3-540-46297-2
eBook Packages: Springer Book Archive