A computational approach for the study of linear complexity of shrunken sequences
From MaRDI portal
Cites work
- An analysis of the structure and complexity of nonlinear binary sequence generators
- Cryptography with shrinking generators. Fundamentals and applications of keystream sequence generators based on irregular decimation
- Espresso: a stream cipher for 5G wireless communication systems
- Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences.
- Generalized Self-Shrinking Generator
- scientific article; zbMATH DE number 1024042 (Why is no real title available?)
- scientific article; zbMATH DE number 1088915 (Why is no real title available?)
- scientific article; zbMATH DE number 2238187 (Why is no real title available?)
- Linear Complexity and Random Sequences
- Linear complexity of generalized sequences by comparison of PN-sequences
- Linear solutions for cryptographic nonlinear sequence generators
- Modified self-shrinking generator
- Multidimensional linear complexity analysis of periodic arrays
- On the decoding delay of encoders for input-constrained channels
- On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
- Recovering decimation-based cryptographic sequences by means of linear CAs
- Shrinking generators based on \(\sigma \)-LFSRs
- The linear complexity of the self-shrinking generator
This page was built for publication: A computational approach for the study of linear complexity of shrunken sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6843961)
