A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences

DOI10.1007/BF00204450zbMath0701.94010OpenAlexW1999289880MaRDI QIDQ914648

Harald Niederreiter

Publication date: 1990

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00204450

zbMATH Keywords

confidence intervalrandom sequencesstream cipherkeystream sequencelinear feedback shift-register sequenceslinear-complexity profile

Mathematics Subject Classification ID

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

Related Items (3)

Expected π-Adic Security Measures of Sequences ⋮ Enumeration results on the joint linear complexity of multisequences ⋮ Linear complexity of generalized cyclotomic binary sequences of order 2

Cites Work

• Analysis and design of stream ciphers
• Linear Complexity and Random Sequences
• The Probabilistic Theory of Linear Complexity
• Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm
• Unnamed Item
• Unnamed Item

This page was built for publication: A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences