Generation of Binary Sequences with Controllable Complexity and Ideal r-Tupel Distribution
From MaRDI portal
Publication:3789478
DOI10.1007/3-540-39118-5_3zbMath0645.94009MaRDI QIDQ3789478
Thomas Siegenthaler, Réjane Forré
Publication date: 1988
Published in: Advances in Cryptology — EUROCRYPT ’87 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-39118-5_3
linear feedback shift register; nonlinear feedforward logic; primitive connection polynomial; key stream generator
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
Related Items
Cites Work
- Unnamed Item
- On the Linear Complexity of Combined Shift Register Sequences
- Analysis of a Nonlinear Feedforward Logic for Binary Sequence Generators
- On Functions of Linear Shift Register Sequences
- Some New Difference Sets
- Galois Switching Functions and Their Applications
- Generation of binary sequences with controllable complexity