Validating a Chaos Based PRBG Under Different Chaotic Maps

Chaos-based random bit generators are abundantly used in chaos-based encryption and security applications, as a fast, deterministic source of randomness, to perform actions like permutation and substitution. The chaotic map used as a source of randomness though may heavily affect the bit generator's statistical randomness, key space, and speed. Thus, any given bit generator may not be equally efficient for all the chaotic maps used as a seed. Motivated by this, the present work considers a bit generator that utilizes a common modulo-based hashing technique, and studies its performance under a plethora of different chaotic maps. For each map, the generator is evaluated with respect to randomness, key space, and operations per bit ratio. This analysis can serve as a guideline for random bit generator usage in future chaos-based encryption designs.