New upper bounds on the linear complexity

DOI10.1016/S0898-1221(99)00331-4zbMath1054.94009WikidataQ61763394 ScholiaQ61763394MaRDI QIDQ1570119

Pino Caballero-Gil

Publication date: 2000

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

CryptographyLinear complexityCyclotomic cosetKey stream generatorNonlinear filter function

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The stability theory of stream ciphers
• Linear Complexity and Random Sequences
• An analysis of the structure and complexity of nonlinear binary sequence generators
• On Certain Nonlinear Recurring Sequences
• Shift-register synthesis and BCH decoding

This page was built for publication: New upper bounds on the linear complexity