The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence
From MaRDI portal
Publication:410701
DOI10.1016/J.TCS.2010.07.014zbMath1293.94049OpenAlexW2055959489MaRDI QIDQ410701
Publication date: 3 April 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.07.014
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Recurrences (11B37)
Related Items (2)
New application methods for word-oriented cryptographic primitives ⋮ Linear recurring sequences and subfield subcodes of cyclic codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optical analogue of the Aharonov-Bohm effect using anisotropic media
- On linear complexity of sequences over \(\text{GF}(2^n)\)
- Error linear complexity measures for multisequences
- Periodic multisequences with large error linear complexity
- The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)
- The stability theory of stream ciphers
- The expected value of the joint linear complexity of periodic multisequences
- Linear complexity over \(\mathbb F_q\) and over \(\mathbb F_{q^m}\) for linear recurring sequences
- Generating linear spans over finite fields
- Generalized Joint Linear Complexity of Linear Recurring Multisequences
- Linear Complexity and Random Sequences
- Values of linear recurring sequences of vectors over finite fields
- Progress in Cryptology - INDOCRYPT 2003
- Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences
This page was built for publication: The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence
