A note on the multiple-recursive matrix method for generating pseudorandom vectors
arXiv:1604.06753 · doi:10.1016/j.dam.2017.01.033
Abstract
The multiple-recursive matrix method for generating pseudorandom vectors was introduced by Niederreiter (Linear Algebra Appl. 192 (1993), 301-328). We propose an algorithm for finding an efficient primitive multiple-recursive matrix method. Moreover, for improving the linear complexity, we introduce a tweak on the contents of the primitive multiple-recursive matrix method.
arXiv comment14 pages
References in corpus (9)
- Euler's constant: Euler's work and modern developments
- Efficient linear feedback shift registers with maximal period
- Primitive Polynomials, Singer Cycles, and Word-Oriented Linear Feedback Shift Registers
- Block Companion Singer Cycles, Primitive Recursive Vector Sequences, and Coprime Polynomial Pairs over Finite Fields
- The Splitting Subspace Conjecture
- An asymptotic formula for the number of irreducible transformation shift registers
- Enumeration of Linear Transformation Shift Registers
- On Multisequences and their extensions
- Twelve new primitive binary trinomials