Abstract
New upper bounds on the linear complexity of binary sequences produced by certain families of nonlinear filter functions are derived. They improve upon Key’s upper bound and allow to deduce a simple recommendation for the design of secure filter generators. As a tool, a new class of cyclotomic cosets whose degeneration is relatively easy to prove in specific conditions is introduced and analysed.
This research has been partially supported by Spanish TEL98-1020 Project.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A.H. Chan, R.A. Games and E.L. Key, On the Complexity of de Bruijn Sequences, Journal of Combinatorial Theory, Series A 33 (1982), 233–246.
A.H. Chan, M. Goresky and A. Klapper, On the Linear Complexity of Feedback Registers, IEEE Transactions on Information Theory Vol. IT-36, No. 3, May (1990).
Z.D. Dai, T. Beth and D. Gollmann, Lower Bounds for the Linear Complexity of Sequences over Residue Rings, Advances in Cryptology-Eurocrypt’90, Lecture Notes in Computer Science Vol. 473, Springer-Verlag, 1991.
C. Ding, Lower Bounds on the Weight Complexities of Cascaded Binary Sequences, Advances in Cryptology-Asiacrypt’90, Lecture Notes in Computer Science Vol. 453, Springer-Verlag, 1990.
C. Ding, G. Xiao and W. Shan, “The Stability Theory of Stream Ciphers, Lecture Notes in Computer Science Vol. 561, Springer-Verlag, 1991.
A. Fúster-Sabater and P. Caballero-Gil, On the Linear Complexity of Nonlinearly Filtered PN-Sequences, Advances in Cryptology-Asiacrypt’94, Lecture Notes in Computer Science Vol. 917, Springer-Verlag, 1995.
S.W. Golomb, “Shift Register Sequences, Holden-Day, San Francisco, California, 1967. Revised edition, Aegean Park Press, Laguna Hills, California, 1982.
K. Imamura and W. Yoshida, A Simple Derivation of the Berlekamp-Massey Algorithm and Some Applications, IEEE Transactions on Information Theory Vol. IT-33 No. 1, Jan (1987).
E.L. Key, An Analysis of the Structure and Complexity of Nonlinear Binary Sequence Generators, IEEE Transactions on Information Theory Vol. IT-22 (1976), 732–736.
P.V. Kumar and R.A. Scholtz, Bounds on the Linear Span of Bent Sequences, IEEE Transactions on Information Theory Vol. IT-29, No. 6 Nov (1983).
R. Lidl and H. Niederreiter, “Introduction to Finite Fields and Their Applications, Cambridge University Press, 1986.
J.L. Massey, Shift Register Synthesis and BCH Decoding, IEEE Transactions on Information Theory, Vol. IT-15 (1969), 122–127.
H. Niederreiter, The Linear Complexity Profile and the Jump Complexity of Keystream Sequences,em Advances in Cryptology-Asiacrypt’90, Lecture Notes in Computer Science Vol. 473, Springer-Verlag, 1991.
R.A. Rueppel, “Analysis and Design of Stream Ciphers, Springer-Verlag, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag London
About this paper
Cite this paper
Caballero-Gil, P. (1999). Regular Cosets and Upper Bounds on the Linear Complexity of Certain Sequences. In: Ding, C., Helleseth, T., Niederreiter, H. (eds) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0551-0_10
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0551-0_10
Publisher Name: Springer, London
Print ISBN: 978-1-85233-196-2
Online ISBN: 978-1-4471-0551-0
eBook Packages: Springer Book Archive