On the linear complexity of products of shift-register sequences

DOI10.1007/3-540-48285-7_13MaRDI QIDQ4934701zbMATH OpenFDO

Authors Rainer Göttfert, Harald Niederreiter

Publication date 31 January 2000

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

Full work available at URL https://doi.org/10.1007/3-540-48285-7_13

Mathematics Subject Classification ID

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

Recommendations

• A general lower bound for the linear complexity of the product of shift-register sequences
• On the linear complexity of product sequences of linear recurring sequences
• On the Linear Complexity of Combined Shift Register Sequences
• Products of linear recurring sequences with maximum complexity
• scientific article; zbMATH DE number 3983066

Cited in

(5)

• Factorization of determinants over finite fields and application in stream ciphers
• On the Linear Complexity of Combined Shift Register Sequences
• On Functions of Linear Shift Register Sequences
• A general lower bound for the linear complexity of the product of shift-register sequences
• Automatic complexity of shift register sequences

This page was built for publication: On the linear complexity of products of shift-register sequences

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