On the linear complexity of the sequences generated by nonlinear filterings
From MaRDI portal
Publication:294851
DOI10.1016/S0020-0190(00)00117-4zbMath1339.94043WikidataQ126377306 ScholiaQ126377306MaRDI QIDQ294851
Luis Javier García Villalba, Amparo Fúster-Sabater
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000001174?np=y
Related Items (3)
On the general classification of nonlinear filters of \(m\)-sequences ⋮ Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators ⋮ Factorization of determinants over finite fields and application in stream ciphers
Cites Work
- On the general classification of nonlinear filters of \(m\)-sequences
- Bounds on the linear span of bent sequences
- Linear Complexity and Random Sequences
- An analysis of the structure and complexity of nonlinear binary sequence generators
- Generation of binary sequences with controllable complexity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the linear complexity of the sequences generated by nonlinear filterings
