An efficient lattice reduction method for F₂-linear pseudorandom number generators using Mulders and Storjohann algorithm
DOI10.1016/J.CAM.2011.06.005zbMATH Open1229.65024OpenAlexW1964740019MaRDI QIDQ645697FDOQ645697
Authors: Shin Harase 
Publication date: 10 November 2011
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2011.06.005
Recommendations
Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Cites Work
- Mersenne twister
- Improved long-period generators based on linear recurrences modulo 2
- Construction and estimation of bases in function fields
- On the Lattice Basis Reduction Multisequence Synthesis Algorithm
- SIMD-oriented fast Mersenne twister: a 128-bit pseudorandom number generator
- Advancing the frontiers of simulation. A Festschrift in honor of George Samuel Fishman
- Factoring multivariate polynomials over finite fields
- On lattice reduction for polynomial matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Twisted GFSR generators II
- Maximally equidistributed pseudorandom number generators via linear output transformations
- On a theorem in the geometry of numbers in a space of Laurent series
- Fast lattice reduction for \(\mathbb F_2\)-linear pseudorandom number generators
- The k -distribution of generalized feedback shift register pseudorandom numbers
- The k-Dimensional Distribution of Combined GFSR Sequences
- Tables of 64-bit Mersenne twisters
- Lattice computations for random numbers
- On the Distribution of k-Dimensional Vectors for Simple and Combined Tausworthe Sequences
Cited In (5)
- Conversion of mersenne twister to double-precision floating-point numbers
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
- Lattice computations for random numbers
- An experimental exploration of Marsaglia's \texttt{xorshift} generators, scrambled
- Fast lattice reduction for \(\mathbb F_2\)-linear pseudorandom number generators
Uses Software
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)
