Knuth [Knu98] shows that iterations a random function perform poorly on average as a random number generator and proposes a generalization in which the next value depends on two or more previous values. This note demonstrates the equally poor performance of a random instance in this more general model.

Contributions to the generation and testing of random number sequences intended for cryptographic applications

Research on the mental representation of numbers has focused on a horizontally aligned mental number line, but more and more findings have begun to implicate a vertical orientation as well. We investigate the relationship between these two orientations when people generate random numbers. In the horizontal condition, people generated larger numbers when they looked right as opposed to left. In ...

An operating system kernel uses cryptographically secure pseudorandom number generator (CSPRNG) for creating address space layout randomization (ASLR) offsets to protect memory addresses of processes from exploitation, storing users’ passwords securely and cryptographic keys. However, at present, popular CSPRNGs such as Yarrow, Fortuna /dev/(u)random which are used by MacOS/iOS/FreeBSD, Windows...

A method is presented for generating random numbers with uniform distribution using linear recurrence sequences very large period lengths. This requires an irreducible polynomial modulo 2 to define the sequence. suitable infinite number of such polynomials presented. The generated in this way can have arbitrarily degree, and a enough order make them practical applications.