Xorshift random number generators from primitive polynomials

A class of Xorshift Random Number Generators (RNGs) are introduced by Marsaglia. We have proposed an algorithm which constructs a primitive Xorshift RNG from a given prim- itive polynomial. We also have shown a weakness present in those RNGs and suggested its solution. A separate algorithm also proposed which returns a full periodic Xorshift generator with desired number of Xorshift operations.

---

Opracowanie w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2018).