Pages that link to "Item:Q1202027"
From MaRDI portal
The following pages link to The stability theory of stream ciphers (Q1202027):
Displaying 50 items.
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\) (Q267793) (← links)
- On third-order nonlinearity of biquadratic monomial Boolean functions (Q275994) (← links)
- A note on the spectral characterization of correlation immune Boolean functions (Q294767) (← links)
- Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\) (Q301631) (← links)
- Distribution of one-error linear complexity of binary sequences for arbitrary prime period (Q394411) (← links)
- Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\) (Q394548) (← links)
- The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence (Q410701) (← links)
- Periodic sequences with maximal \(N\)-adic complexity and large \(k\)-error \(N\)-adic complexity over \(Z/(N)\) (Q413471) (← links)
- Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\) (Q429602) (← links)
- The lower bound on the second-order nonlinearity of a class of Boolean functions with high nonlinearity (Q429740) (← links)
- Multisequences with large linear and \(k\)-error linear complexity from a tower of Artin-Schreier extensions of function fields (Q439096) (← links)
- FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\) (Q488927) (← links)
- Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\) (Q491089) (← links)
- Enhanced Boolean functions suitable for the filter model of pseudo-random generator (Q494592) (← links)
- Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks (Q498981) (← links)
- The linear complexity of a class of binary sequences with period \(2p\) (Q499750) (← links)
- Some cyclic codes with prime length from cyclotomy of order 4 (Q502406) (← links)
- On the nonlinearity of S-boxes and linear codes (Q507951) (← links)
- Cyclic codes from the second class two-prime Whiteman's generalized cyclotomic sequence with order 6 (Q517721) (← links)
- Further crosscorrelation properties of sequences with the decimation factor \({d=\frac{p^n+1}{p+1}-\frac{p^n-1}{2}}\) (Q607552) (← links)
- Improving the high order nonlinearity lower bound for Boolean functions with given algebraic immunity (Q608297) (← links)
- On the \(k\)-error linear complexity of \(\ell\)-sequences (Q609360) (← links)
- Improved results on periodic multisequences with large error linear complexity (Q609363) (← links)
- Asymptotic analysis on the normalized \(k\)-error linear complexity of binary sequences (Q664386) (← links)
- Some cyclic codes from some monomials (Q681329) (← links)
- Further properties of several classes of Boolean functions with optimum algebraic immunity (Q735033) (← links)
- Period distribution of generalized discrete Arnold cat map (Q740968) (← links)
- On second-order nonlinearity and maximum algebraic immunity of some bent functions in \(\mathcal{PS}^{+}\) (Q741403) (← links)
- An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences (Q742512) (← links)
- A note on cyclic codes from APN functions (Q744011) (← links)
- Efficient design methods of low-weight correlation-immune functions and revisiting their basic characterization (Q777373) (← links)
- New constructions of resilient functions with strictly almost optimal nonlinearity via non-overlap spectra functions (Q778439) (← links)
- A new construction of odd-variable rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity (Q820554) (← links)
- Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\) (Q862718) (← links)
- The asymptotic behavior of the joint linear complexity profile of multisequences (Q877184) (← links)
- Error linear complexity measures for multisequences (Q883329) (← links)
- 9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class (Q963062) (← links)
- The lower bounds on the second order nonlinearity of three classes of Boolean functions with high nonlinearity (Q1007842) (← links)
- Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm (Q1008964) (← links)
- Periodic multisequences with large error linear complexity (Q1009057) (← links)
- Remarks on a cyclotomic sequence (Q1009130) (← links)
- Joint linear complexity of multisequences consisting of linear recurring sequences (Q1032485) (← links)
- Lower bounds on error complexity measures for periodic LFSR and FCSR sequences (Q1032491) (← links)
- How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences (Q1032492) (← links)
- Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity (Q1035809) (← links)
- The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\) (Q1046471) (← links)
- Maximum correlation analysis of nonlinear combining functions (Q1129825) (← links)
- Linear complexity of generalized cyclotomic binary sequences of order 2 (Q1266420) (← links)
- The expected value of the joint linear complexity of periodic multisequences (Q1394937) (← links)
- New upper bounds on the linear complexity (Q1570119) (← links)
