Enhancing security and randomness in cryptography and non-cryptographic applications with ORNA algorithm

Abstract In this paper, we advocate for using PRNGs to generate long sequences of statistically random numbers, also known as pseudorandom numbers. It has several practical applications, including cryptography, weather-based stimulation, procedural environment noise generation in games and casinos, and scientific simulations of real-world problems, like city traffic systems that use it to stimulate cars. One distinctive feature of our approach is the PRNG algorithm we propose; this algorithm has successfully produced statistically sound long-term sequences. The properties of the PRNG are assessed using several statistical methods. Our work presents the Oscillating Random Number Algorithm (ORNA), a new kind of random number generator, and examines both the statistical tests proposed by NIST and the results that ORNA has generated. The following also describes the several preceding algorithms developed, including the Mersenne Twister Algorithm (MT19937) and the Permuted Congruential Algorithm (PCG128), and compares ORNA’s graphical efficiency to theirs. In this work, we compared ORNA to MT19937 and PCG128, and found that ORNA excels according to all 16 statistical tests. ORNA has three primary benefits, namely, superior statistical performance, quicker code execution, and simpler code implementation due to the algorithm’s reduced complexity.