A pseudorandom bit generator based on new multi-delayed Chebyshev map

• We construct a new multi-delayed Chebyshev map.
• The dynamics analysis shows that this new map is more complex than the original Chebyshev map.
• We propose a new pseudorandom bit generator based on this multi-delayed Chebyshev map.
• Both statistics and security analysis show that our PRBG is with good randomness and highly capable to withstand attacks.

Chaotic map is regarded as an important pseudorandom source in the design of pseudorandom bit generators due to its excellent properties, such as unpredictability, randomness, aperiodicity, sensitive dependence on initial conditions and parameters. One-dimensional Chebyshev map is one of the most popular maps in designing pseudorandom bit generator. In order to improve its security, in this paper, we will first construct a new multi-delayed Chebyshev map. The dynamics analysis shows that this new map is more complex than the original Chebyshev map. Furthermore, we propose a new pseudorandom bit generator based on this multi-delayed Chebyshev map; the statistics and security analysis show that our pseudorandom bit generator has good pseudorandom characteristics and is highly capable to withstand attacks.