Efficient linear feedback shift registers with maximal period
From MaRDI portal
(Redirected from Publication:1609404)
Abstract: We introduce and analyze an efficient family of linear feedback shift registers (LFSR's) with maximal period. This family is word-oriented and is suitable for implementation in software, thus provides a solution to a recent challenge posed in FSE '94. The classical theory of LFSR's is extended to provide efficient algorithms for generation of irreducible and primitive LFSR's of this new type.
Recommendations
Cites work
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 854547 (Why is no real title available?)
- scientific article; zbMATH DE number 3422259 (Why is no real title available?)
- An explicit similarity transform between cellular automata and LFSR matrices
- Factorization of trinomials over Galois fields of characteristic 2
- On multisequence shift register synthesis and generalized-minimum- distance decoding of Reed-Solomon codes
- On shortest linear recurrences
- On the minimal polynomial of the product of linear recurring sequences
- Orthogonal arrays, primitive trinomials, and shift-register sequences
Cited in
(24)- A construction of skew LRS of maximal period over finite fields based on the defining tuples of factors
- Digit sequences of skew linear recurrences of maximal period over Galois rings
- Block companion singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields
- Representations of skew linear recurrent sequences of maximal period over finite field;Представления скрученных линейных рекуррентных последовательностей максимального периода над конечным полем
- Enumeration of linear transformation shift registers
- An asymptotic formula for the number of irreducible transformation shift registers
- The software performance of authenticated-encryption modes
- scientific article; zbMATH DE number 1857536 (Why is no real title available?)
- Skew linear recurring sequences of maximal period over Galois rings
- Linear recurrences over a finite field with exactly two periods
- Word-oriented transformation shift registers and their linear complexity
- Specified sequence linear feedback shift registers
- Equidistant filters based on skew ML-sequences over fields
- A note on the multiple-recursive matrix method for generating pseudorandom vectors
- Skew \(\sigma\)-splittable linear recurrent sequences with maximal period
- Guaranteeing the diversity of number generators
- Description of maximal skew linear recurrences in terms of multipliers
- On the number of irreducible linear transformation shift registers
- Primitive transformation shift registers over finite fields
- Nonlinear vectorial primitive recursive sequences
- High-Speed Parallel Architectures for Linear Feedback Shift Registers
- Skew LRS of maximal period over Galois rings
- New representaions of elements of skew linear recurrent sequences via trace function based on the noncommutative Hamilton-Cayley theorem
- Methods of construction of skew linear recurrent sequences with maximal period based on the Galois polynomials factorization in the ring of matrix polynomials
This page was built for publication: Efficient linear feedback shift registers with maximal period
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1609404)
