Some long-period random number generators using shifts and xors

Richard Peirce Brent


Marsaglia recently introduced a class of `xorshift' random number generators with periods \(2^n-1\) for \(n = 32, 64,\ldots\). Here Marsaglia's xorshift generators are generalised to obtain fast and high quality random number generators with extremely long periods. Whereas random number generators based on primitive trinomials may be unsatisfactory, because a trinomial has very small weight, these new generators can be chosen so that their minimal polynomials have a large number of non-zero terms and, hence, a large weight. A computer search using Magma found good random number generators for\(~n\) a power of two up to 4096. These random number generators are implemented in a free software package \texttt{xorgens}.

Full Text:

PDF BibTeX References


Remember, for most actions you have to record/upload into this online system
and then inform the editor/author via clicking on an email icon or Completion button.
ANZIAM Journal, ISSN 1446-8735, copyright Australian Mathematical Society.