Random Number Generators

Random number generation

Random number generation is a process where, most often through a random number generator (RNG), a sequence of numbers or symbols that cannot be reasonably predictable better than random chance is created. This means that the particular outcome sequence will contain some patterns that are discernible in hindsight but unpredictable to foresight. The real random number generators can be hardware random-number generators(HRNGS) that produce random numbers. Each generation is a function of the present value of a physical environment's attribute that is constantly changing and in a way almost impossible to understand. This would be in contrast to so-called "random number generations" done by pseudorandom number generators (PRNGs) that generate numbers that only look random but are in fact pre-determined--these generations can be reproduced simply by knowing the state of the PRNG.

Various applications of randomness has led to the development diverse methods of creating random data. Some of these methods have existed since ancient times, among whose ranks are famous "classic" examples, including the rolling of dice, coin flipping, the shifting of playing cards and the use of yarrow-stalks (for predictions) as part of the I Ching, as well as numerous other methods. Because of them being mechanical techniques making large numbers of numbers that were sufficiently random (important in the field of statistics) required much work and effort. Therefore, the results could be collated and distributed as random number tables.

A variety of algorithms to generate pseudorandom numbers are in use. None of them achieve the concept of genuine randomness, although they may achieve, with various degrees of effectiveness, some of the statistical tests for randomness that are designed to gauge the extent to which their results can be unpredictable (that is how much the patterns they generate are evident). This generally makes them unusable for various applications, such as the cryptographic field. However, thoughtfully designed digitally-secure cryptographically encrypted pseudorandom generation systems (CSPRNGS) are also exist, equipped with specific functions specifically designed to be used in cryptography.

Practical applications and uses [editPractical applications and uses[edit

Main article: Application in randomness

Random number generators are used for games of chance, statistical sampling as well as computer simulation cryptography, fully randomized design as well as other areas where an unpredictability of the outcome is desirable. In general, when applications have unpredictable outcomes as their primary feature, such as in security applications, hardware generators generally prevail over pseudorandom algorithmswhen they are feasible.

Pseudorandom number generators are very useful when developing Monte Carlo method simulations since testing is facilitated by having the capability of running the identical number of random sequences repeatedly by starting from that same random seed. They can also be used in cryptography as long that it is ensured that the seed is not disclosed. The receiver and the sender can create the identical set of numbers for use as keys.

The creation of pseudorandom numbers is a critical and common task in computer programming. While cryptography and some numerical algorithms demand a large amount of visible randomness, other applications require the slightest amount of uncertainty. Examples of this could be giving a user an "random quote of the day" or determining the direction a computer-controlled enemy could be moving in a computer game. A less pronounced form of randomness is employed in hash algorithmic and when creating amortized-searching and sorting algorithms.

Some programs that appear on first glance to be suited to be suitable for randomization are not all that simple. For example, a system that "randomly" selects music tracks for use as a background music system will only appear random. It might even contain ways to regulate the amount of music played A true random system could not be restricted by the same thing appearing multiple times in succession.