An analysis of the structure and complexity of nonlinear binary sequence generators

DOI10.1109/TIT.1976.1055626zbMath0356.94017MaRDI QIDQ4128385

Edwin L. Key

Publication date: 1976

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Related Items (31)

Cryptanalysis of the class of maximum period Galois NLFSR-based stream ciphers ⋮ On the general classification of nonlinear filters of \(m\)-sequences ⋮ On the linear complexity of the sequences generated by nonlinear filterings ⋮ The measures of sequence complexity for EEG studies ⋮ Linear Complexity of Periodic Sequences: A General Theory ⋮ On the linear complexity of product sequences of linear recurring sequences ⋮ Linear complexity of second order PN_sequences addition with single order PN_sequence in nonlinear filter generator ⋮ Algebraic attacks on a class of stream ciphers with unknown output function ⋮ On the frequency of symbols in sequences generated by nonlinear feedforward generators ⋮ New \(p\)-ary sequence family with low correlation and large linear span ⋮ On ideal \(t\)-tuple distribution of filtering de Bruijn sequence generators ⋮ Characteristic digit-sum sequences ⋮ Linear Span analysis of a set of periodic sequence generators ⋮ Cellular Automata-Based Structures to Compute the Solutions of Linear Difference Equations ⋮ Trace representation of some generalized cyclotomic sequences of length \(pq\) ⋮ Attacks Against Filter Generators Exploiting Monomial Mappings ⋮ New nonbinary sequence families with low correlation, large size, and large linear span ⋮ Rotating-table games and derivatives of words ⋮ On the Multi-output Filtering Model and Its Applications ⋮ A family of keystream generators with large linear complexity ⋮ Analysis of the generalized self-shrinking generator ⋮ An efficient algorithm to generate binary sequences for cryptographic purposes ⋮ A wide family of nonlinear filter functions with a large linear span ⋮ Properties of the output sequence of a simplest 2-linear shift register over Z2n ⋮ Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators ⋮ Parallel Generation of ℓ-Sequences ⋮ Factorization of determinants over finite fields and application in stream ciphers ⋮ New upper bounds on the linear complexity ⋮ On the complexities of de-Bruijn sequences ⋮ Nonlinear feedforward sequences of \(m\)-sequences. I ⋮ Complexity analysis of binary nonlinear feedforward sequences through minimum polynomials of compound matrices

This page was built for publication: An analysis of the structure and complexity of nonlinear binary sequence generators