Testing for Randomness in Pseudo Random Number Generators Algorithms in a Cryptographic Application

Abstract

The most effective cryptographic algorithm has more randomness in the numbers a generator generates, and the more secured it is to be used for protecting confidential data. Sometimes developers find it difficult to determine which Random Number Generators (RNGs) can provide a much secured Cryptographic System for secured enterprise application implementations. This research aims to find an effective Pseudo Random Number Generator algorithm among Fibonacci Random Numbers Generator Algorithms, Gaussian Random Numbers Generator Algorithm, Specific Range Random Numbers Generator Algorithms, and Secure Random numbers Generators, which are the most common Pseudo Random Numbers Generators Algorithms, that can be used to improve the security of Cryptographic software systems. The researchers employed Chi-Square test on the first 100 random numbers between 0 to 1000 generated using the above generators and it concluded that, Fibonacci Random Numbers Generator Algorithms can provide a more secured cryptographic application.

Keywords Pseudo Random Number Generators, Randomness, Cryptography, Software