Root counting, the DFT and the linear complexity of nonlinear filtering

DOI10.1023/A:1008256920596zbMath0918.94010OpenAlexW1538837969MaRDI QIDQ1265231

Kenneth G. Paterson

Publication date: 17 August 1999

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008256920596

zbMATH Keywords

cryptographydiscrete Fourier transformnonlinear filteringlinear complexitystream cipher

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (8)

Nonlinear vectorial primitive recursive sequences ⋮ Characteristic digit-sum sequences ⋮ A Survey of Recent Attacks on the Filter Generator ⋮ A family of keystream generators with large linear complexity ⋮ Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators ⋮ On Attacks on Filtering Generators Using Linear Subspace Structures ⋮ Binary sequences with period \(N\) and nonlinear complexity \(N - 2\) ⋮ Factorization of determinants over finite fields and application in stream ciphers

This page was built for publication: Root counting, the DFT and the linear complexity of nonlinear filtering