Generation of Binary Sequences with Controllable Complexity and Ideal r-Tupel Distribution

DOI10.1007/3-540-39118-5_3zbMATH Open0645.94009OpenAlexW1542275631MaRDI QIDQ3789478FDOQ3789478

Authors: Thomas Siegenthaler, Réjane Forré 

Publication date: 1988

Published in: Advances in cryptology -- EUROCRYPT '87. Workshop on the theory and application of cryptographic techniques, Amsterdam, Netherlands, April 13--15, 1987. Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-39118-5_3

Recommendations

• scientific article; zbMATH DE number 4191552
• A generator of one linear feedback shift register
• Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point
• scientific article; zbMATH DE number 3983072
• Coding and Cryptography

zbMATH Keywords

linear feedback shift registernonlinear feedforward logicprimitive connection polynomialkey stream generator

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Cites Work

• Title not available (Why is that?)
• Generation of binary sequences with controllable complexity
• Some New Difference Sets
• On the Linear Complexity of Combined Shift Register Sequences
• On Functions of Linear Shift Register Sequences
• Galois Switching Functions and Their Applications
• Analysis of a Nonlinear Feedforward Logic for Binary Sequence Generators

Cited In (4)

• Title not available (Why is that?)
• On ideal \(t\)-tuple distribution of filtering de Bruijn sequence generators
• On ideal \(t\)-tuple distribution of orthogonal functions in filtering de Bruijn generators
• Title not available (Why is that?)

This page was built for publication: Generation of Binary Sequences with Controllable Complexity and Ideal r-Tupel Distribution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789478)