Name
Title | ||
|---|---|---|
A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences |
Abstract | ||
|---|---|---|
A method for analyzing the linear complexity of nonlinear filterings of PN-sequences that is based on the Discrete Fourier Transform is presented. The method makes use of "Blahut's theorem", which relates the linear complexity of an N-periodic sequence in GF(q)N and the Hamming weight of its frequency-domain associate. To illustrate the power of this approach, simple proofs are given of Key's bound on linear complexity and of a generalization of a condition of Groth and Key for which equality holds in this bound. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/3-540-48658-5_31 | CRYPTO |
Keywords | Field | DocType |
simple proof,nonlinear filterings,discrete fourier transform,linear complexity,n-periodic sequence,frequency-domain associate,hamming weight,fourier transform approach,frequency domain,nonlinear filter,fourier transform | Discrete-time Fourier transform,Non-uniform discrete Fourier transform,Discrete mathematics,Fourier inversion theorem,Parseval's theorem,Discrete Fourier transform (general),Discrete Fourier transform,Fourier transform on finite groups,Fractional Fourier transform,Mathematics | Conference |
ISBN | Citations | PageRank |
3-540-58333-5 | 31 | 2.89 |
References | Authors | |
5 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| James L. Massey | 1 | 1096 | 272.94 |
| Shirlei Serconek | 2 | 54 | 4.94 |