The following pages link to (Q2707427):
Displaying 16 items.
- Multisequences with high joint nonlinear complexity (Q306345) (← links)
- Improved results on periodic multisequences with large error linear complexity (Q609363) (← links)
- A lattice-based minimal partial realization algorithm for matrix sequences of varying length (Q662164) (← links)
- Error linear complexity measures for multisequences (Q883329) (← links)
- Lattice basis reduction algorithms and multi-dimensional continued fractions (Q958608) (← links)
- Enumeration results on the joint linear complexity of multisequences (Q998652) (← links)
- Periodic multisequences with large error linear complexity (Q1009057) (← links)
- Joint linear complexity of multisequences consisting of linear recurring sequences (Q1032485) (← links)
- The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\) (Q1046471) (← links)
- An efficient structural attack on NIST submission DAGS (Q1633442) (← links)
- Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences (Q2483203) (← links)
- Linear complexity over \(\mathbb F_q\) and over \(\mathbb F_{q^m}\) for linear recurring sequences (Q2517819) (← links)
- Cryptanalysis of the FLIP Family of Stream Ciphers (Q2835597) (← links)
- Fast Correlation Attacks: Methods and Countermeasures (Q3013077) (← links)
- Generalized Joint Linear Complexity of Linear Recurring Multisequences (Q3600447) (← links)
- A Lattice-Based Minimal Partial Realization Algorithm (Q3600448) (← links)
