Abstract
The method of root counting is a well established technique in the study of the linear complexity of sequences. Recently, Massey and Serconek [11] have introduced a Discrete Fourier Transform approach to the study of linear complexity. In this paper, we establish the equivalence of these two approaches. The power of the DFT methods are then harnessed to re-derive Rueppel's Root Presence Test, a key result in the theory of filtering of m-sequences, in an elegant and concise way. The application of Rueppel's Test is then extended to give lower bounds on linear complexity for new classes of filtering functions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.E. Blahut, Theory and Practice of Error Control Codes, Addison-Wesley Publishing Company (1983).
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 ScienceVol. 917, Springer-Verlag, Berlin (1995).
A. Fúster-Sabater and P. Caballero-Gil, Linear Span Analysis of a Set of Periodic Sequence Generators, Proceedings, Cryptography and Coding: 5th IMA Conference, Lecture Notes in Computer Science Vol. 1025, Springer-Verlag, Berlin (1995) pp. 22-33.
R. Göttfert and H. Niederreiter, On the Minimal Polynomial of the Product of Linear Recurring Sequences, Finite Fields and Their Applications 1(1995) pp. 204-218.
E.J. Groth, Generation of binary sequences with controllable complexity, IEEE Trans. Inform. Theory IT-17(1971) pp. 288-296.
E.L. Key, An analysis of the structure and complexity of nonlinear binary sequence generators, IEEE Trans. Inform. Theory IT-22(1976) pp. 732-736.
A. Klapper, d-form Sequences: Families of Sequences with Low Correlation Values and Large Linear Spans, IEEE Trans. Inform. Theory IT-41(1995) pp. 423-431.
P.V. Kumar and R.A. Sholtz, Bounds on the linear span of bent sequences, IEEE Trans. Inform. Theory IT-29(1983) pp. 854-862.
R. Lidl and H. Niederreiter, Introduction to Finite Fields and their ApplicationsCambridge University Press, Cambridge (1986).
J.L. Massey, Shift-register synthesis and BCH decoding, IEEE Trans. Inform. Theory IT-15(1969) pp. 122-127.
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, Springer-Verlag, Berlin (1994) pp. 332-340.
J.L. Massey and S. Serconek, Linear Complexity of Sequences with Arbitrary Period and a Generalized Discrete Fourier Transform, Advances in Cryptology-CRYPTO'96, Lecture Notes in Computer Science Vol. 1109, Springer-Verlag, Berlin (1996) pp. 358-371.
J.-S. No and P.V. Kumar, A New Family of Binary Pseudorandom Sequences Having Optimal Periodic Correlation Properties and Large Linear Span, IEEE Trans. Inform. Theory IT-35(1989) pp. 371-379.
R.A. Rueppel, Analysis and Design of Stream CiphersSpringer-Verlag, Berlin (1986).
R.A. Rueppel, Stream Ciphers, Contemporary Cryptology, ed. G.J. Simmons, IEEE Press, NewYork (1992).
R.A. Sholtz and L.R. Welch, GMW Sequences, IEEE Trans. Inform. Theory IT-30(1984) pp. 548-553.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Paterson, K.G. Root Counting, the DFT and the Linear Complexity of Nonlinear Filtering. Designs, Codes and Cryptography 14, 247–259 (1998). https://doi.org/10.1023/A:1008256920596
Issue Date:
DOI: https://doi.org/10.1023/A:1008256920596