Lattice computations for random numbers

DOI10.1090/S0025-5718-99-01112-6zbMath0952.65003MaRDI QIDQ4942787

Raymond Couture, Pierre L'Ecuyer

Publication date: 15 March 2000

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

computational efficiencyrandom number generation\(k\)-distributionlattice computationsTezuka's algorithm

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10)

Related Items (6)

An efficient lattice reduction method for \(\mathbf F_2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm ⋮ On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators ⋮ Conversion of mersenne twister to double-precision floating-point numbers ⋮ A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space ⋮ Maximally equidistributed pseudorandom number generators via linear output transformations ⋮ Fast lattice reduction for $\mathbf {F}_{2}$-linear pseudorandom number generators

Cites Work

• Factoring multivariate polynomials over finite fields
• The k -distribution of generalized feedback shift register pseudorandom numbers
• The k-Dimensional Distribution of Combined GFSR Sequences
• NEW PRIMITIVE TRINOMIALS OF MERSENNE-EXPONENT DEGREES FOR RANDOM-NUMBER GENERATION
• Maximally equidistributed combined Tausworthe generators
• On the Distribution of k-Dimensional Vectors for Simple and Combined Tausworthe Sequences

This page was built for publication: Lattice computations for random numbers