A relative investigation of one-dimensional chaotic maps intended for light-weight cryptography in smart grid

Abstract

Technology is quite important in today's contemporary society, especially when it comes to information transmission. The free and open interchange of data via networks is essential for the development of communication technologies. As a result, it is essential to ensure the security of transmitted data, especially digital data like readings from smart meters in smart grids. As a result, the study of chaos-based cryptography has received a great deal of interest in the realm of data security. Due to its favourable characteristics, including ergodicity, pseudo-randomness, non-periodicity, and sensitivity to beginning circumstances, chaotic maps have become a popular choice for data encryption. Researchers have concentrated on factors like the highest Lyapunov exponent and sensitivity to beginning circumstances while evaluating these maps. The MATLAB platform has been used to run simulations that produce bifurcation diagrams and calculate Lyapunov exponents in order to analyse and compare various chaotic maps. Further research is required since these experiments have shown considerable improvements in the chaotic behaviour of one-dimensional maps over time. There are two key areas covered by the review. On the basis of their bifurcation diagrams and Lyapunov exponents, it compares newly presented maps in the first place. It then looks at the techniques used to combine one-dimensional chaotic maps. The work shows the potential of chaotic maps for cryptography applications and emphasises the growing significance of data security in the digital age.

Keywords

• Bifurcation
• Chaos theory
• Cryptography
• Lyapunov exponent
• One-dimensional chaotic map