Abstract

Everyday, a vast amount of information is created and shared on the internet. Security steps and methods are needed to ensure the data is sent and stored safely. Random numbers are essential to cryptography because they are crucial to securing data. In recent years, the use of chaos theory has become increasingly important in producing pseudo-random number sequences in the field of cryptography. But the majority of fundamental chaotic maps have a variety of limitations, such as constrained chaotic regions, a low Lyapunov Exponent (LE), chaotic annulling conditions, and high computational cost. In this research, we construct a new chaotic map based on the skew tent map (STM) in order to find a better solution to these problems. The proposed chaotic map includes significantly enhanced chaotic behaviour and has a more comprehensive chaotic range and higher LE. Furthermore, two novels Pseudo-random Number Generators (PRNGs) based on a new M-STM chaotic map, have been built to investigate its application in security-related fields. The performance evaluations of these generators demonstrate their ability to generate pseudo-random number sequences that exhibit improved statistical properties efficiently.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call