Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers
DOI10.1007/s10623-010-9387-7zbMath1263.11108arXiv0904.1331OpenAlexW3099877718MaRDI QIDQ629934
Meena Kumari, Sudhir R. Ghorpade, Sartaj Ul Hasan
Publication date: 10 March 2011
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0904.1331
Singer cycleprimitive polynomiallinear feedback shift register (LFSR)primitive recursive vector sequenceSinger subgroupsplitting subspaces
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear algebraic groups over finite fields (20G40) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Polynomials over finite fields (11T06)
Related Items (26)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Block companion singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields
- The probability that a matrix be nilpotent
- On the number of matrices with given characteristic polynomial
- On the number of nilpotent matrices with coefficients in a finite field
- Counting nilpotent endomorphisms
- Order of elements in the groups related to the general linear group.
- Factorization of polynomials and some linear-algebra problems over finite fields
- The multiple-recursive matrix method for pseudorandom number generation
- Improved bounds in the multiple-recursive matrix method for pseudorandom number and vector generation
- Remarks on Singer cyclic groups and their normalizers.
- Pseudorandom Vector Generation by the Multiple-Recursive Matrix Method
- Endliche Gruppen I
- A Theorem in Finite Projective Geometry and Some Applications to Number Theory
This page was built for publication: Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers