Root Counting, the DFT and the Linear Complexity of Nonlinear Filtering

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.

[1]  James L. Massey,et al.  A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences , 1994, CRYPTO.

[2]  H. Niederreiter,et al.  On the Minimal Polynomial of the Product of Linear Recurring Sequences , 1995 .

[3]  R. Blahut.  Theory and practice of error control codes , 1983 .

[4]  Andrew Klapper,et al.  D-form Sequences: Families of Sequences with Low Correlation Values and Large Linear Spans , 1995, IEEE Trans. Inf. Theory.

[5]  Pino Caballero-Gil,et al.  Linear Span Analysis of a Set of Periodic Sequence Generators , 1995, IMACC.

[6]  P. Vijay Kumar,et al.  A new family of binary pseudorandom sequences having optimal periodic correlation properties and large linear span , 1989, IEEE Trans. Inf. Theory.

[7]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[8]  Edwin L. Key,et al.  An analysis of the structure and complexity of nonlinear binary sequence generators , 1976, IEEE Trans. Inf. Theory.

[9]  Pino Caballero-Gil,et al.  On the Linear Complexity of Nonlinear Filtered PN-sequences , 1994, ASIACRYPT.

[10]  R. Scholtz,et al.  GMW sequences (Corresp.) , 1984 .

[11]  Edward J. Groth,et al.  Generation of binary sequences with controllable complexity , 1971, IEEE Trans. Inf. Theory.

[12]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: List of Symbols , 1986 .

[13]  P. Vijay Kumar,et al.  Bounds on the linear span of bent sequences , 1983, IEEE Trans. Inf. Theory.