Pseudorandom sequence generators based on shift registers over finite chain rings
From MaRDI portal
Publication:3383085
Recommendations
- Primitive transformation shift registers over finite fields
- On periodic properties of polylinear shift registers
- Constructing pseudorandom sequences by means of 2-linear shift register
- 2-linear shift register over the Galois ring of even characteristic
- Периодические свойства многомерного полиномиального генератора над кольцом Галуа. IV
Cites work
- scientific article; zbMATH DE number 1245626 (Why is no real title available?)
- 2-linear shift register over the Galois ring of even characteristic
- Constructing pseudorandom sequences by means of 2-linear shift register
- Cyclic structure of a polynomial generator over the Galois ring
- On the structure of graph of polynomial transformation of the Galois ring
- Periodic properties of multidimensional polynomial generator over the Galois ring. I.
- Transitive polynomial transformations of residue class rings
- Uniformly distributed sequences in computer algebra or how to construct program generators of random numbers
Cited in
(7)- Периодические свойства многомерного полиномиального генератора над кольцом Галуа. IV
- SPRING: Fast Pseudorandom Functions from Rounded Ring Products
- Investigating some special sequence lengths generated in an external exclusive-NOR type LFSR
- Generating Cyclic-Random Sequences in a Constrained Space for In-System Validation
- Initializing generalized feedback shift register pseudorandom number generators
- Shift Register Sequences
- scientific article; zbMATH DE number 3976358 (Why is no real title available?)
This page was built for publication: Pseudorandom sequence generators based on shift registers over finite chain rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3383085)
