Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point

DOI10.1007/3-540-46885-4_50zbMATH Open0734.94010OpenAlexW1499936391MaRDI QIDQ3363231FDOQ3363231

Authors: Harald Niederreiter 

Publication date: 1990

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-46885-4_50

Recommendations

• scientific article; zbMATH DE number 4062985
• The Probabilistic Theory of Linear Complexity
• scientific article; zbMATH DE number 177032
• Linear Complexity and Random Sequences
• A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences

zbMATH Keywords

linear complexityrandom sequencestream cipherslinear feedback shift registerkeystream sequencecontinued fractions for formal Laurent series

Mathematics Subject Classification ID

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

Cited In (13)

• A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Jump and hop randomness tests for binary sequences
• Linear complexity profiles and jump complexity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generation of Binary Sequences with Controllable Complexity and Ideal r-Tupel Distribution
• On distribution properties of sequences with perfect linear complexity profile
• Linear complexity of generalized cyclotomic binary sequences of order 2
• Hausdorff dimension for sets of continued fractions of formal Laurent series
• On the linear complexity of FCSR sequences
• The Probabilistic Theory of Linear Complexity

This page was built for publication: Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point

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