Pages that link to "Item:Q3834146"
From MaRDI portal
The following pages link to On the linear complexity of functions of periodic GF(q) sequences (Q3834146):
Displaying 6 items.
- Factorization of determinants over finite fields and application in stream ciphers (Q1032496) (← links)
- A remark on the minimal polynomial of the product of linear recurring sequences (Q1267007) (← links)
- Linear recurring sequences over rings and modules (Q1915326) (← links)
- A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance (Q2277233) (← links)
- Novel way to research nonlinear feedback shift register (Q2335934) (← links)
- Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators (Q3600338) (← links)