A note on the multiple-recursive matrix method for generating pseudorandom vectors
arXiv:1604.06753v211 citations
AI Analysis
This work addresses a specific technical issue in pseudorandom number generation, likely incremental as it builds on prior methods.
The paper tackles the problem of generating pseudorandom vectors using the multiple-recursive matrix method, proposing an algorithm to find an efficient primitive version and introducing a tweak to improve linear complexity.
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.