Pseudo-random number generator based on discrete-space chaotic map

Abstract

A new method for obtaining pseudo-random numbers, based on discrete-space chaotic map, is presented. The proposed method uses a discrete chaotic map, based on the composition of permutations. The randomness of pseudo-random sequences generated by proposed method is verified using NIST 800-22 test suite and TestU01. Proposed method is not affected by dynamical degradation, so the process of generation of pseudo-random numbers is not influenced by approximations of any kind. The advantage of the proposed method is that it has virtually unlimited key space and the ability to generate same number of different pseudo-random sequences as other secure discrete-space chaotic methods, but with significantly lower memory space requirements. Also, higher level of security and great cycle lengths can be achieved. Small memory requirements could make proposed PRNG applicable in devices with limited memory space.