On the linear complexity of product sequences of linear recurring sequences

DOI10.1080/09720529.2000.10697894zbMath1004.94015OpenAlexW2896804104MaRDI QIDQ4549925

Guglielmo Morgari, Michele Elia, Oscar Steila

Publication date: 2 February 2003

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2000.10697894

zbMATH Keywords

binary linear recurring sequence

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Analysis and design of stream ciphers
• Products of linear recurring sequences with maximum complexity
• An analysis of the structure and complexity of nonlinear binary sequence generators
• Shift-register synthesis and BCH decoding
• Generation of binary sequences with controllable complexity

This page was built for publication: On the linear complexity of product sequences of linear recurring sequences