Xorshift random number generators from primitive polynomials

2017/04/28 by Bishoi, Susil Kumar, Maharana, Surya Narayan
#12E20 and 12E05 #15B33 #94A55 #94A60 #Cryptography and Security (cs.CR) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1705.00098

Abstract

A class of xorshift random number generators (RNGs) are introduced by Marsaglia. We have proposed an algorithm which constructs a full period xorshift RNG from a given primitive polynomial. It is shown there is a weakness present in those RNGs and is suggested its improvement. A separate algorithm is also proposed which returns a full period xorshift generator with desired number of xorshift operations.%We also introduce the notion of tweaked primitive multiple-recursive matrix method with improved linear complexity.

Related

• An experimental exploration of Marsaglia's xorshift generators, scrambled
• Further scramblings of Marsaglia's xorshift generators
• Recursive Random Number Generator Using Prime Reciprocals
• Period of the d-Sequence Based Random Number Generator
• A Simple construction of the Pseudorandom Generator from Permutation