So any MATLAB implementation of Pseudo-Random Number generators or Hash functions that requires bitwise arithmetic and C-semantics on integer operations is bound to be too slow to be usable.

The article presents the results of a comparative analysis of randomness testing using statistical tests in the Information Technology Laboratory of the National Institute of Standards and Technology ...

The best we can do is to generate long sequences that have some of the key properties of random numbers. The programs that do this are called pseudo-random number generators.

Feel free to share your theories on the best random number generator designs below, or send your best builds straight to the tipsline. Randomly, of course!

Random numbers are important for computer encryption, lotteries, scientific modelling, and gambling. Current methods of generating random numbers can produce predictable results.