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

Portable random number generators

โœ Scribed by Gerald P. Dwyer Jr.; K.B. Williams

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
67 KB
Volume
27
Category
Article
ISSN
0165-1889

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 computers. Based on an extensive search, we provide parameter values better than those previously available for this generator.

๐Ÿ“œ SIMILAR VOLUMES

Random-number generators
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.

Biometric random number generators
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

Random number generators for microcomput
Random number generators for microcomputers
โœ Wilfred Rosenbaum; John Syrotuik; Richard Gordon ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science โš– 331 KB

The feasibility of random number generation using microcomputers is discussed and the appropriateness of alternative algorithms is evaluated on the basis of several criteria of statistical randomness. The relative deficiencies of each algorithm are cited and a modified Fibonacci generator is recomme

Testing parallel random number generator
Testing parallel random number generators
โœ Ashok Srinivasan; Michael Mascagni; David Ceperley ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 228 KB

Monte Carlo computations are considered easy to parallelize. However, the results can be adversely affected by defects in the parallel pseudorandom number generator used. A parallel pseudorandom number generator must be tested for two types of correlations--(i) intrastream correlation, as for any se