Pages that link to "Item:Q1265231"
From MaRDI portal
The following pages link to Root counting, the DFT and the linear complexity of nonlinear filtering (Q1265231):
Displaying 9 items.
- Factorization of determinants over finite fields and application in stream ciphers (Q1032496) (← links)
- Nonlinear vectorial primitive recursive sequences (Q1667449) (← links)
- Characteristic digit-sum sequences (Q1704209) (← links)
- On the real complexity of a complex DFT (Q1752320) (← links)
- Binary sequences with period \(N\) and nonlinear complexity \(N - 2\) (Q2311428) (← links)
- Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators (Q3600338) (← links)
- A Survey of Recent Attacks on the Filter Generator (Q5386073) (← links)
- On Attacks on Filtering Generators Using Linear Subspace Structures (Q5448575) (← links)
- A family of keystream generators with large linear complexity (Q5938956) (← links)