A note on the multiple-recursive matrix method for generating pseudorandom vectors

DOI10.1016/J.DAM.2017.01.033zbMATH Open1432.11102arXiv1604.06753OpenAlexW2580764755MaRDI QIDQ1786872FDOQ1786872

Authors: Susil Kumar Bishoi, Himanshu Kumar Haran, Sartaj Ul Hasan 

Publication date: 25 September 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1604.06753

Recommendations

• Pseudorandom Vector Generation by the Multiple-Recursive Matrix Method
• On the Period Length of Pseudorandom Vector Sequences Generated by Matrix Generators
• The multiple-recursive matrix method for pseudorandom number generation
• scientific article; zbMATH DE number 4064343
• scientific article; zbMATH DE number 4024597

zbMATH Keywords

linear complexitylinear feedback shift registermultiple-recursive matrix methodLangford arrangement

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)

Cites Work

• Title not available (Why is that?)
• On fast multiplication of polynomials over arbitrary algebras
• Fast multiplication of polynomials over fields of characteristic 2
• Fast multiplication of large numbers
• Euler's constant: Euler's work and modern developments
• Title not available (Why is that?)
• Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers
• Algorithms for exponentiation in finite fields
• The multiple-recursive matrix method for pseudorandom number generation
• Efficient linear feedback shift registers with maximal period
• Enumeration of linear transformation shift registers
• The splitting subspace conjecture
• Word-oriented transformation shift registers and their linear complexity
• An asymptotic formula for the number of irreducible transformation shift registers
• Block companion singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields
• Ten new primitive binary trinomials
• Factorization of polynomials and some linear-algebra problems over finite fields
• Improved bounds in the multiple-recursive matrix method for pseudorandom number and vector generation
• Pseudorandom Vector Generation by the Multiple-Recursive Matrix Method
• The great trinomial hunt
• Enumeration of Splitting Subspaces over Finite Fields
• Title not available (Why is that?)
• A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space
• Fast algorithm for finding primitive polynomials over GF(q)
• Skew LRS of maximal period over Galois rings

Cited In (12)

• Methods of construction of skew linear recurrent sequences with maximal period based on the Galois polynomials factorization in the ring of matrix polynomials
• Investigating results and performance of search and construction algorithms for word-based LFSRs, \(\sigma\)-LFSRs
• Representations of skew linear recurrent sequences of maximal period over finite field;Представления скрученных линейных рекуррентных последовательностей максимального периода над конечным полем
• Pseudorandom Vector Generation by the Multiple-Recursive Matrix Method
• New representaions of elements of skew linear recurrent sequences via trace function based on the noncommutative Hamilton-Cayley theorem
• Skew \(\sigma\)-splittable linear recurrent sequences with maximal period
• Shrinking generators based on \(\sigma \)-LFSRs
• Nonlinear vectorial primitive recursive sequences
• On the Period Length of Pseudorandom Vector Sequences Generated by Matrix Generators
• Improved bounds in the multiple-recursive matrix method for pseudorandom number and vector generation
• When lagged Fibonacci generators jump
• The multiple-recursive matrix method for pseudorandom number generation

This page was built for publication: A note on the multiple-recursive matrix method for generating pseudorandom vectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786872)