PSEUDO RANDOM NUMBER GENERATORS ALGORITHMS AND APPLICATIONS
Pseudo Random Numbers (PRNs) are a kind of random numbers that are generated using a seed value. PRNs are generated by Pseudo Random Number Generators (PRNGs) which are also known as Deterministic Random Number Generators. There have been various pseudo random number generators proposed from time to time. These PRNGs aim to generate pseudo random numbers that are uniformly distributed, completely random and have a large periodicity. There are many state of the art algorithms that aim to generate such random numbers which further find application in session key generation, simulation and games and other applications requiring long bit sequences. This paper aims to bring together such PRNG algorithms, their statistical results and related applications and also aims to provide a general conclusion as to which of these is the most efficient and best technique.