Products of linear recurring sequences with maximum complexity

DOI10.1109/TIT.1987.1057268MaRDI QIDQ3028877zbMATH OpenFDO

Authors Rainer A. Rueppel, Othmar Staffelbach

Publication date 1987

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.1987.1057268

zbMATH Keywords

GF(q) sequenceslinear feedback shift registersmaximum linear complexityproducts of linear recurring sequencesrunning-key generator

Mathematics Subject Classification ID

Finite fields and commutative rings (number-theoretic aspects) (11T99) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• On the linear complexity of product sequences of linear recurring sequences
• On the linear complexity of functions of periodic GF(q) sequences
• A remark on the minimal polynomial of the product of linear recurring sequences
• On the Linear Complexity of Combined Shift Register Sequences
• scientific article; zbMATH DE number 39524

Cited in

(19)

• Factorization of determinants over finite fields and application in stream ciphers
• A remark on the minimal polynomial of the product of linear recurring sequences
• Boolean functions: degree and support
• Analysis of \((k_ 0,k_ 1)\) clock-controlled sequences
• A complexity measure for families of binary sequences
• On the minimal polynomial of the product of linear recurring sequences
• Linear recurring sequences over rings and modules
• Constructing digitized chaotic time series with a guaranteed enhanced period
• scientific article; zbMATH DE number 1594284 (Why is no real title available?)
• Productly linearly independent sequences
• Generalization of Siegenthaler inequality and Schnorr-Vaudenay multipermutations
• On the linear complexity of functions of periodic GF(q) sequences
• scientific article; zbMATH DE number 39524 (Why is no real title available?)
• scientific article; zbMATH DE number 691469 (Why is no real title available?)
• scientific article; zbMATH DE number 1088917 (Why is no real title available?)
• On the linear complexity of product sequences of linear recurring sequences
• scientific article; zbMATH DE number 1394288 (Why is no real title available?)
• The conjecture of V. I. Nechaev on the product of linear recurrences
• Parametric construction approach of balanced Boolean functions from two-to-one mappings

This page was built for publication: Products of linear recurring sequences with maximum complexity

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