Fast lattice reduction for $\mathbf {F}_{2}$-linear pseudorandom number generators
From MaRDI portal
Publication:3081290
DOI10.1090/S0025-5718-2010-02391-9zbMath1225.11096MaRDI QIDQ3081290
Makoto Matsumoto, Mutsuo Saito, Shin Harase
Publication date: 7 March 2011
Published in: Mathematics of Computation (Search for Journal in Brave)
Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (2)
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
Uses Software
Cites Work
- Unnamed Item
- Improved long-period generators based on linear recurrences modulo 2
- \(F[x\)-lattice basis reduction algorithm and multisequence synthesis]
- Maximally equidistributed pseudorandom number generators via linear output transformations
- On a theorem in the geometry of numbers in a space of Laurent series
- Factoring multivariate polynomials over finite fields
- Construction and estimation of bases in function fields
- Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences
- An analogue to Minkowski's geometry of numbers in a field of series
- On the Lattice Basis Reduction Multisequence Synthesis Algorithm
- The k -distribution of generalized feedback shift register pseudorandom numbers
- Mersenne twister
- The k-Dimensional Distribution of Combined GFSR Sequences
- An Implementation of the Lattice and Spectral Tests for Multiple Recursive Linear Random Number Generators
- Lattice computations for random numbers
- On the Distribution of k-Dimensional Vectors for Simple and Combined Tausworthe Sequences
- Shift-register synthesis and BCH decoding
This page was built for publication: Fast lattice reduction for $\mathbf {F}_{2}$-linear pseudorandom number generators
