A robust PRBG based on chaotic maps enhanced with a two’s complement operation
摘要
Chaotic maps are a significant part of cryptography due to their dynamic and complex behaviors, making them relevant for use in cryptographic applications. However, traditional maps like logistic, tent, and duffing undergo challenges such as predictable behaviors, periodic orbits, and low efficiency. Thus, it is crucial to enhance these maps to increase their efficiency. This paper introduces a two’s complement-based method that is applied to the mantissa (extracted from the state variables) of traditional chaotic maps. Enhanced chaotic maps– TCLM, TCTM, and TCDM are proposed based on two’s complement operation. Further, a pseudo-random bit generator (PRBG) is developed based on the modified maps. Performance analysis of enhanced chaotic maps is done using various parameters and simulations such as bifurcation diagram, Lyapunov exponent, iteration function diagram, and trajectory plot. Statistical and security analysis for the proposed PRBG is conducted through the NIST test suite, TestU01, Shannon entropy, Kolmogorov entropy, linear complexity analysis, and other relevant security metrics. Experimentation conducted verified the robustness of the proposed systems.