Root counting, the DFT and the linear complexity of nonlinear filtering (Q1265231)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1202996
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Root counting, the DFT and the linear complexity of nonlinear filtering |
scientific article; zbMATH DE number 1202996 |
Statements
Root counting, the DFT and the linear complexity of nonlinear filtering (English)
0 references
17 August 1999
0 references
The linear complexity of a binary sequence can be analysed with one of the two methods: the root counting or the method based on the Discrete Fourier Transform (DFT) and Blahut's Theorem. The main goal of the paper is to show that both approaches are equivalent: any analysis based on root counting can be converted into a DFT-type analysis and vice-versa. It also illustrates the utility of the DFT approach to linear complexity by applying it to the problem of nonlinear filtering of binary \(m\)-sequences.
0 references
linear complexity
0 references
discrete Fourier transform
0 references
nonlinear filtering
0 references
stream cipher
0 references
cryptography
0 references
0.7976271510124207
0 references
0.7897844910621643
0 references
0.7833824157714844
0 references
