Lattice computations for random numbers
From MaRDI portal
Recommendations
- An efficient lattice reduction method for \(\mathbf F_2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm
- Fast lattice reduction for F₂-linear pseudorandom number generators
- scientific article; zbMATH DE number 194571
- The lattice structure of pseudo-random vectors generated by matrix generators
- Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
Cites work
- Factoring multivariate polynomials over finite fields
- Maximally equidistributed combined Tausworthe generators
- NEW PRIMITIVE TRINOMIALS OF MERSENNE-EXPONENT DEGREES FOR RANDOM-NUMBER GENERATION
- On the Distribution of k-Dimensional Vectors for Simple and Combined Tausworthe Sequences
- The k -distribution of generalized feedback shift register pseudorandom numbers
- The k-Dimensional Distribution of Combined GFSR Sequences
Cited in
(8)- Maximally equidistributed pseudorandom number generators via linear output transformations
- A vectorizable random lattice
- Conversion of mersenne twister to double-precision floating-point numbers
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
- Fast lattice reduction for F₂-linear pseudorandom number generators
- A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space
- scientific article; zbMATH DE number 1396735 (Why is no real title available?)
- An efficient lattice reduction method for \(\mathbf F_2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm
This page was built for publication: Lattice computations for random numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4942787)
