Pseudo Random Number Generators Employing Three Numerical Solvers of Chaotic Generators

Pseudo-Random Number Generator (PRNG) is required for various applications, especially cryptography. PRNGs are employed in symmetric-key algorithms, where a single key is used as a seed to the PRNG to generate a sequence of random numbers that are employed to encrypt and decrypt certain data. This work proposes a PRN G system that employs the time series generated from the numerical solution of systems of chaotic-generators Differential Equations (DEs) utilizing three different DEs solvers; Euler, Runge-Kutta 4th order, and Runge-Kutta 5th order. Various systems were solved using each of the three methods and their randomness was evaluated by several tests. The PRNGs passed the NIST test and reached an entropy of 7.9998, very close to 8 which is the optimal value, proving the robustness of this method for encryption applications.