The linear complexity profile and the jump complexity of keystream sequences
From MaRDI portal
Recommendations
- Linear complexity profiles and jump complexity
- A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences
- Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point
- Progress in Cryptology - INDOCRYPT 2003
- The Probabilistic Theory of Linear Complexity
Cited in
(14)- Linear complexity of generalized cyclotomic binary sequences of order 2
- New upper bounds on the linear complexity
- Counting functions and expected values for the \(k\)-error linear complexity
- Jump and hop randomness tests for binary sequences
- Enumeration results on linear complexity profiles and lattice profiles
- Continued fraction for formal Laurent series and the lattice structure of sequences
- Linear complexity profiles and jump complexity
- On distribution properties of sequences with perfect linear complexity profile
- On the calculation of the linear equivalence bias of jump controlled linear finite state machines
- Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point
- The Probabilistic Theory of Linear Complexity
- Progress in Cryptology - INDOCRYPT 2003
- A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences
- Enumeration results on the joint linear complexity of multisequences
This page was built for publication: The linear complexity profile and the jump complexity of keystream sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036869)