Analysis of a Nonlinear Feedforward Logic for Binary Sequence Generators
From MaRDI portal
Publication:3737366
DOI10.1007/3-540-39805-8_20zbMATH Open0601.94006OpenAlexW1559341160MaRDI QIDQ3737366FDOQ3737366
Jakob Bernasconi, Christoph G. Günther
Publication date: 1986
Published in: Advances in Cryptology — EUROCRYPT’ 85 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-39805-8_20
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)
Cited In (8)
- A multiple-sequence generator based on inverted nonlinear autonomous machines
- Title not available (Why is that?)
- Generation of Binary Sequences with Controllable Complexity and Ideal r-Tupel Distribution
- Comments on L. J. García-Villalba and M. C. Rodríguez-Palánquex, A family of keystream generators with large linear complexity, Appl. Math. Lett. 14, No.5, 545-547 (2001; Zbl 0995.94031)
- On the balancedness of nonlinear generators of binary sequences.
- Equidistant filters based on skew ML-sequences over fields
- On the frequency of symbols in sequences generated by nonlinear feedforward generators
- Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators
Recommendations
- Title not available (Why is that?) 👍 👎
- On the frequency of symbols in sequences generated by nonlinear feedforward generators 👍 👎
- Minimal linear equivalent analysis of a variable-memory binary sequence generator 👍 👎
- On the balancedness of nonlinear generators of binary sequences. 👍 👎
- Aspects of pseudorandomness in nonlinear generators of binary sequences. 👍 👎
This page was built for publication: Analysis of a Nonlinear Feedforward Logic for Binary Sequence Generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3737366)