A New Approach to Pseudorandom Number Generation
Ankur, Divyanjali, Vikas Pareek
Abstract
Ankur, Divyanjali, Vikas Pareek
Abstract
Pseudorandom number generators are used for session key generation, simulation and games, and other applications that need long bit sequences which posses a lot of qualities like large cycle length and uniform distribution over the range of number domain. There are many state of art algorithms present. This paper is the result of an effort to develop a new Pseudorandom Number Generator that can be used for non-cryptographic applications. The paper includes concept of the new random number generator, its statistical testing result and related proofs.
OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Pseudorandom number generators are used for session key generation, simulation and games, and other applications that need long bit sequences which posses a lot of qualities like large cycle length and uniform distribution over the range of number domain. There are many state of art algorithms present. This paper is the result of an effort to develop a new Pseudorandom Number Generator that can be used for non-cryptographic applications. The paper includes concept of the new random number generator, its statistical testing result and related proofs.
Key concepts: Pseudorandom number generator, Random number generation, Pseudorandom generator theorem, Random seed, Computer science, Pseudorandom generator, Pseudorandomness, Cryptography