An analysis of the structure and complexity of nonlinear binary sequence generators
From MaRDI portal
Cited in
(34)- Factorization of determinants over finite fields and application in stream ciphers
- Complexity analysis of binary nonlinear feedforward sequences through minimum polynomials of compound matrices
- Rotating-table games and derivatives of words
- Nonlinear feedforward sequences of \(m\)-sequences. I
- The measures of sequence complexity for EEG studies
- New upper bounds on the linear complexity
- On ideal t-tuple distribution of filtering de Bruijn sequence generators
- Characteristic digit-sum sequences
- On the complexities of de-Bruijn sequences
- Cryptanalysis of the class of maximum period Galois NLFSR-based stream ciphers
- On the frequency of symbols in sequences generated by nonlinear feedforward generators
- On the general classification of nonlinear filters of \(m\)-sequences
- On the linear complexity of the sequences generated by nonlinear filterings
- Linear complexity of periodic sequences: a general theory
- Cellular Automata-Based Structures to Compute the Solutions of Linear Difference Equations
- Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators
- Parallel Generation of ℓ-Sequences
- Algebraic attacks on a class of stream ciphers with unknown output function
- New p-ary sequence family with low correlation and large linear span
- On the linear complexity of product sequences of linear recurring sequences
- Linear span analysis of a set of periodic sequence generators
- Attacks against filter generators exploiting monomial mappings
- Linear complexity of second order PN_sequences addition with single order PN_sequence in nonlinear filter generator
- New nonbinary sequence families with low correlation, large size, and large linear span
- Properties of the output sequence of a simplest 2-linear shift register over Z2n
- Analysis of the generalized self-shrinking generator
- On the multi-output filtering model and its applications
- A family of keystream generators with large linear complexity
- An efficient algorithm to generate binary sequences for cryptographic purposes
- On the number of \(\ell \)-suitable Boolean functions in constructions of filter and combining models of stream ciphers
- A computational approach for the study of linear complexity of shrunken sequences
- A wide family of nonlinear filter functions with a large linear span
- Scalable nonlinear sequence generation using composite Mersenne product registers
- Trace representation of some generalized cyclotomic sequences of length pq
This page was built for publication: An analysis of the structure and complexity of nonlinear binary sequence generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4128385)