Brent, Richard2015-12-081548-7660http://hdl.handle.net/1885/34049Marsaglia, (2003) has described a class of "xorshift" random number generators (RNGs) with periods 2n - 1 for n = 32, 64, etc. We show that the sequences generated by these RNGs are identical to the sequences generated by certain linear feedback shift register (LFSR) generators using "exclusive or" (xor) operations on n-bit words, with a recurrence defined by a primitive polynomial of degree n.Keywords: LFSR sequences; Linear feedback shift registers; Primitive polynomials; Random number generators; Xorshift RNGs20042015-12-08