Analysis of a Nonlinear Feedforward Logic for Binary Sequence Generators

DOI10.1007/3-540-39805-8_20zbMath0601.94006OpenAlexW1559341160MaRDI QIDQ3737366

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

zbMATH Keywords

linear complexitylinear feedback shift registerperiodic behavior

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (4)

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) ⋮ Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators ⋮ Equidistant filters based on skew ML-sequences over fields

This page was built for publication: Analysis of a Nonlinear Feedforward Logic for Binary Sequence Generators