Pseudo-random bit generation algorithm based on Chebyshev polynomial and Tinkerbell map

This paper proposes a novel pseudo-random bit generation algorithm combining Chebyshev polynomial and Tinkerbell map. We calculated the key space of the proposed scheme. The output zero-one bits are statistically tested with three packages: NIST, DIEHARD and ENT. The experimental results show that the data are uniformly distributed with sufficient enough statistical properties to disturb brute-force attacks.