Abstract
In this paper we consider the binary sequences whose bits satisfy any set of linear equations from a wide class of sets, of which the equations in the perfect profile characterization theorem are typical. We show that the linear complexity profile any such sequence will be restricted in the sense that it will have no jumps of a certain parity above a certain height.
Chapter PDF
Similar content being viewed by others
References
Carter, G.D., ‘Aspects of Local Linear Complexity’, Ph.D. Thesis, University of London, (1988).
Dai, Z.D., ‘Proof of Rueppel’s linear complexity conjecture’. To appear.
Massey, J.L., ‘Shift register synthesis and BCH decoding’, IEEE Transactions on Information Theory, IT-15, (1969), pp 122–127.
Niederreiter, H., ‘The probabilistic theory of linear complexity’, Advances in Cryptology: Proceedings of Eurocrypt 88, Springer-Verlag, Berlin, (1988), pp 191–209.
Rueppel, R.A., ‘New Approaches to Stream Ciphers’, D.Sc. Dissertation, Swiss Federal Institute of Technology, Zurich, (1984).
Wang, M.Z. and Massey, J.L., ‘The characterization of all binary sequences with perfect linear complexity profiles’. Presented at Eurocrypt 86.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carter, G. (1990). Some Conditions on the Linear Complexity Profiles of Certain Binary Sequences. In: Quisquater, JJ., Vandewalle, J. (eds) Advances in Cryptology — EUROCRYPT ’89. EUROCRYPT 1989. Lecture Notes in Computer Science, vol 434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46885-4_70
Download citation
DOI: https://doi.org/10.1007/3-540-46885-4_70
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53433-4
Online ISBN: 978-3-540-46885-1
eBook Packages: Springer Book Archive