Abstract: Random and Pseudo-random number generators are of great interest and are still sought for the benefit of stronger keys for cryptosystems. A new cryptographically secure algorithm for pseudo-random number generation is proposed. The proposed algorithm is characterized by a multi-stage modular design. It combines various processes such as bit swapping, modular operations and secret splitting techniques in order to achieve adequate confusion and diffusion. The obtained results through applying the National Institute of Technology randomness tests clearly show that the algorithm is capable of producing high quality cryptographically secure pseudo-random numbers.

Keywords: Computer security, Cryptosystems, Key distribution, Modular design, Pseudo-random numbers generators, Security agreement