๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Random number generators

โœ Scribed by Marsaglia G.


Book ID
127397176
Year
2003
Tongue
English
Weight
176 KB
Category
Library

No coin nor oath required. For personal study only.

โœฆ Synopsis


The author discusses some promising new random number generators, as well as formulates the mathematical basis that makes them random variables in the same sense as more familiar ones in probability and statistics, emphasizing his view that randomness exists only in the sense of mathematics. He discusses the need for adequate seeds that provide the axioms for that mathematical basis, and gives examples from Law and Gaming, where inadequacies have led to difficulties. He also describes new versions of the widely used Diehard Battery of Tests of Randomness.Key words: Random number generator, Diehard Test


๐Ÿ“œ SIMILAR VOLUMES


Random-number generators
โœ Alan B. Forsythe ๐Ÿ“‚ Article ๐Ÿ“… 1968 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 217 KB

A commonly used uniform random-number generator is examined in light of a genetic-simulation problem. Although this generator is often useful, it proves defective in this case. The author suggests that any proposed generator be checked for the properties needed by the simulation problem at hand.

Random number generators
โœ Marsaglia G. ๐Ÿ“‚ Library ๐Ÿ“… 2003 ๐ŸŒ English โš– 1 MB
Uniform Random Number Generators
โœ MacLaren, M. Donald; Marsaglia, George ๐Ÿ“‚ Article ๐Ÿ“… 1965 ๐Ÿ› Association for Computing Machinery ๐ŸŒ English โš– 415 KB
Gaussian random number generators
โœ Thomas, David B.; Luk, Wayne; Leong, Philip H.W.; Villasenor, John D. ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Association for Computing Machinery ๐ŸŒ English โš– 417 KB
Portable random number generators
โœ Gerald P. Dwyer Jr.; K.B. Williams ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 67 KB

We present a random number generator that is useful for serious computations and can be implemented easily in any language that has 32-bit signed integers, for example C, C ++ and FORTRAN. This combination generator has a cycle length that would take two millennia to compute on widely used desktop c

Biometric random number generators
โœ J. Szczepanski; E. Wajnryb; J.M. Amigรณ; Maria V. Sanchez-Vives; M. Slater ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 169 KB

Up to now biometric methods have been used in cryptography for authentication purposes. In this paper we propose to use biological data for generating sequences of random bits. We point out that this new approach could be particularly useful to generate seeds for pseudo-random number generators and