Some long-period random number generators using shifts and xors
Brent, Richard P.
arXiv, 1004.3115 / Harvested from arXiv
Text on arXiv
Marsaglia recently introduced a class of xorshift random number generators (RNGs) with periods 2n-1 for n = 32, 64, etc. Here we give a generalisation of Marsaglia's xorshift generators in order to obtain fast and high-quality RNGs with extremely long periods. RNGs based on primitive trinomials may be unsatisfactory because a trinomial has very small weight. In contrast, our generators can be chosen so that their minimal polynomials have large weight (number of nonzero terms). A computer search using Magma has found good generators for n a power of two up to 4096. These have been implemented in a free software package xorgens.
Publié le : 2010-04-19
Classification:  Computer Science - Data Structures and Algorithms,  Mathematics - Number Theory,  Statistics - Computation,  11K45,  G.3 
@article{1004.3115,
     author = {Brent, Richard P.},
     title = {Some long-period random number generators using shifts and xors},
     journal = {arXiv},
     volume = {2010},
     number = {0},
     year = {2010},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1004.3115}
}

Brent, Richard P. Some long-period random number generators using shifts and xors. arXiv, Tome 2010 (2010) no. 0, . http://gdmltest.u-ga.fr/item/1004.3115/