A New Chaotic Map Based Secure and Efficient Pseudo-Random Bit Sequence Generation

Abstract

The security strength of symmetric encryption schemes rely on its internal source responsible for generation of efficient random encryption keys. A cryptographically strong encryption scheme needs a perfect mechanism that can generate statistically profound and secure pseudo-random sequences. To fulfill the requirement, we propose to present a novel pseudo-random number generation (PRNG) algorithm based on dynamical behaviour of a new and improved one-dimensional chaotic map. The dynamical characteristics of proposed chaotic map are analyzed through lyapunov exponents and bifurcation diagrams. The upright features of improved chaotic map are explored for synthesis of an efficient PRNG algorithm. The performance of proposed PRNG algorithm is examined using NIST SP800-22 and TestU01 randomness test suites, linear complexity, 0-1 balancedness, key-sensitivity, key space, etc. The randomness and other relevant statistical performance results of proposed PRNG algorithm demonstrate that it is consistent and suitable for its usage in cryptographic applications.