Improvement Pseudo-Random Bit Generator Based on Hybrid Chaotic 1D Logistic Maps and 2D Hénon system

Abstract

A pseudo-random number generator (PRNG) or pseudo-random bit generator (PRBG) is a program created a sequence of numbers that can mimic sequences of random numbers. The PRNGs are valued for their practical speed and reproducibility. In this paper PRNG is presented based on combining two chaotic one dimensional (1D) logistic maps and two dimensional (2D) Hénon system has been improved. The algorithm generates at each iteration sequences of 128 bit-sequences based on random initial seeds and control parameter for the hybrid chaotic design. The generator is assessed by a randomness test called Federal Information Processing Standard (FIPS 140-1) which check the randomness of string with length of (20000) bits. The created sequences bits hold a good randomness statistical properties which are demonstrate from the results of the test. These string of bits is suitable for cryptographic applications, therefore it applied on digital speech encryption as a mask key. The results show that it works very well on encrypted the signal through de-correlated the speech samples, and with a high quality for the recovered speech signal through the visualization of the signal.