Chaotic Maps in Cryptography

Abstract

The majority of the duties have been moved to an online environment due to the COVID-19 epidemic. The growth of industries including secure online banking, critical multi-media transfer, and e-commerce has been phenomenal. Consequently, there is a pressing need to create extremely safe mechanisms that are impenetrable to outside hackers. The pseudo-random number generator, that depends on chaotic maps, is the technique that forms the basis of encryption methods. With respect to the original seed value, mathematical operations known as chaotic maps yield a very random structure. An overview of the implementation of chaotic maps for multimedia cryptography and pseudo-random number generation is provided in this work. We discovered that Ikeda chaotic map accomplished the lowest value of 0.00006 for correlation coefficient following closely examining all of the latest studies. Employing the quantum chaotic map, the greatest entropy was 7.999995 bits per byte. Through the Zaslavsky chaotic map, 0.23 seconds is the smallest execution time was recorded, while the hyperchaotic map yielded the maximum data rate of 15.367 Mbits per second. Technologies for chaotic map-based pseudo-random number generation include chaotic system simulation, multi-media cryptography, digital marketing, video game graphics and chaotic missile systems.