Abstract
An algorithm for computing lower bounds on the global linear complexity of nonlinearly filtered PN-sequences is presented. Unlike the existing methods, the algorithm here presented is based on the realization of bit wise logic operations. The numerical results obtained are valid for any nonlinear function with a unique term of maximum order and for any maximal-length LFSR. To illustrate the power of this technique, we give some high lower bounds that confirm Rueppel's conclusion about the exponential growth of the linear complexity in filter generators.
This work was supported by R&D Spanish Programs TIC91-0386 and TIC95-0080.
Preview
Unable to display preview. Download preview PDF.
References
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.
E.L. Key, ‘An Analysis of the Structure and Complexity of Nonlinear Binary Sequence Generators', IEEE Trans. Inform. Theory, Vol. IT-22, pp. 732–736, Nov. 1976.
D.E. Knuth, ‘The Art of Computer Programming, Vol. 2: Seminumerical Algorithms', Addison-Wesley, 1981.
P.V. Kumar and R.A. Scholtz, ‘Bounds on the Linear Span of Bent Sequences', IEEE Transactions on Information Theory, Vol. IT-29, pp. 854–862, Nov. 1983.
J.L. Massey, ‘Shift-Register Synthesis and BCH Decoding', IEEE Transactions on Information Theory, Vol. IT-15, pp. 122–127, Jan. 1969.
J.L. Massey and S. Serconek, ‘A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences', Advances in Cryptology-CRYPTO'94, Lecture Notes in Computer Science Vol. 839, pp. 332–340, Springer-Verlag, 1994.
K.G. Paterson, ‘New Lower Bounds on the Linear Complexity of Nonlinearly Filtered m-Sequences', submitted to IEEE Transactions on Information Theory, 1995.
R.A. Rueppel, ‘Analysis and Design of Stream Ciphers', Springer-Verlag, New York, 1986.
G.J. Simmons (ed.), ‘Contemporary Cryptology: The Science of Information Integrity', IEEE Press, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caballero-Gil, P., Fúster-Sabater, A. (1995). Linear Span analysis of a set of periodic sequence generators. In: Boyd, C. (eds) Cryptography and Coding. Cryptography and Coding 1995. Lecture Notes in Computer Science, vol 1025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60693-9_5
Download citation
DOI: https://doi.org/10.1007/3-540-60693-9_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60693-2
Online ISBN: 978-3-540-49280-1
eBook Packages: Springer Book Archive