An efficient lattice reduction method for F₂-linear pseudorandom number generators using Mulders and Storjohann algorithm
From MaRDI portal
(Redirected from Publication:645697)
An efficient lattice reduction method for \(\mathbf F 2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm
An efficient lattice reduction method for \(\mathbf F 2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm
Recommendations
Cites work
- scientific article; zbMATH DE number 1186973 (Why is no real title available?)
- scientific article; zbMATH DE number 1390097 (Why is no real title available?)
- Advancing the frontiers of simulation. A Festschrift in honor of George Samuel Fishman
- Construction and estimation of bases in function fields
- Factoring multivariate polynomials over finite fields
- Fast lattice reduction for \(\mathbb F_2\)-linear pseudorandom number generators
- Improved long-period generators based on linear recurrences modulo 2
- Lattice computations for random numbers
- Maximally equidistributed pseudorandom number generators via linear output transformations
- Mersenne twister
- On a theorem in the geometry of numbers in a space of Laurent series
- On lattice reduction for polynomial matrices
- On the Distribution of k-Dimensional Vectors for Simple and Combined Tausworthe Sequences
- On the Lattice Basis Reduction Multisequence Synthesis Algorithm
- SIMD-oriented fast Mersenne twister: a 128-bit pseudorandom number generator
- Tables of 64-bit Mersenne twisters
- The k -distribution of generalized feedback shift register pseudorandom numbers
- The k-Dimensional Distribution of Combined GFSR Sequences
- Twisted GFSR generators II
Cited in
(5)- An experimental exploration of Marsaglia's \texttt{xorshift} generators, scrambled
- Lattice computations for random numbers
- Fast lattice reduction for \(\mathbb F_2\)-linear pseudorandom number generators
- Conversion of mersenne twister to double-precision floating-point numbers
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
This page was built for publication: An efficient lattice reduction method for \(\mathbf F_2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645697)