The multiple-recursive matrix method for pseudorandom number generation

DOI10.1006/ffta.1995.1002zbMath0823.11041OpenAlexW2066648063MaRDI QIDQ1344090

Harald Niederreiter

Publication date: 6 November 1995

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.1995.1002

zbMATH Keywords

periodicitydiscrepancyfigure of meritserial testmultiple-recursive matrix method\((t,M,s)\)-netuniform pseudorandom number generation

Mathematics Subject Classification ID

Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Random number generation in numerical analysis (65C10) Irregularities of distribution, discrepancy (11K38) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (33)

A triangular class of skew maximum-period polynomials ⋮ A brief and understandable guide to pseudo-random number generators and specific models for security ⋮ Pseudorandom number generator based on the Bernoulli map on cubic algebraic integers ⋮ Polynomial matrices, splitting subspaces and Krylov subspaces over finite fields ⋮ Nonlinear vectorial primitive recursive sequences ⋮ Скрученные $\sigma$-разделимые линейные рекуррентные последовательности максимального периода ⋮ On the frequency of symbols in sequences generated by nonlinear feedforward generators ⋮ Constructing quasi-cyclic codes from linear algebra theory ⋮ Set partitions, tableaux, and subspace profiles of regular diagonal operators ⋮ Enumeration of anti-invariant subspaces and Touchard's formula for the entries of the \(q\)-Hermite Catalan matrix ⋮ Shrinking generators based on \(\sigma \)-LFSRs ⋮ Representations of skew linear recurrent sequences of maximal period over finite field;Представления скрученных линейных рекуррентных последовательностей максимального периода над конечным полем ⋮ Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers ⋮ A survey of some applications of finite fields ⋮ Block companion singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields ⋮ Splitting subspaces and a finite field interpretation of the Touchard-Riordan formula ⋮ The splitting subspace conjecture ⋮ On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators ⋮ An asymptotic formula for the number of irreducible transformation shift registers ⋮ Investigating results and performance of search and construction algorithms for word-based LFSRs, \(\sigma\)-LFSRs ⋮ On the number of irreducible linear transformation shift registers ⋮ Quasi-cyclic codes as codes over rings of matrices ⋮ Unnamed Item ⋮ A note on the multiple-recursive matrix method for generating pseudorandom vectors ⋮ Pseudorandom Vector Generation by the Multiple-Recursive Matrix Method ⋮ Random packing of hyperspheres and Marsaglia's parking lot test ⋮ Unimodular polynomial matrices over finite fields ⋮ Методы построения скрученных линейных рекуррентных последовательностей максимального периода, базирующиеся на факторизации многочленов Галуа в кольце матричных многочленов ⋮ Новые представления знаков скрученных ЛРП при помощи функции след, базирующиеся на некоммутативной теореме Гамильтона - Кэли ⋮ Constructions of nets via OAs of strength 3 with a prescribed property ⋮ Splitting subspaces of linear operators over finite fields ⋮ When lagged Fibonacci generators jump ⋮ Enumeration of linear transformation shift registers

This page was built for publication: The multiple-recursive matrix method for pseudorandom number generation