On the minimal polynomial of the product of linear recurring sequences

DOI10.1006/FFTA.1995.1016zbMath0819.11059OpenAlexW2080953207MaRDI QIDQ1891284

Rainer Göttfert, Harald Niederreiter

Publication date: 30 May 1995

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.1995.1016

zbMATH Keywords

linear recurring sequencescharacteristic polynomiallower boundminimal polynomiallinear complexity

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Recurrences (11B37) Polynomials over finite fields (11T06)

Related Items (5)

Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators ⋮ Unnamed Item ⋮ A remark on the minimal polynomial of the product of linear recurring sequences ⋮ Factorization of determinants over finite fields and application in stream ciphers ⋮ Efficient linear feedback shift registers with maximal period

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