Abstract

Recently, a little research into image encryption has been used on chaotic economic maps. The current paper suggests a bit-level permutation and a non-invertible chaotic economic map to encrypt an image. Firstly, the secret key generation is linked to the plain image. So, the suggested algorithm may resist both known-plaintext and chosen-plaintext attacks. Then a bit-level permutation is performed for all the binary bits of the plain image's pixels, using the logistic map (permutation stage). It is used to improve the algorithm's security. Then pixel diffusion is applied using the 2D non-invertible chaotic economic map and bit-wise XOR operations. It is used to change the pixels' values and make them highly random. The results of the experiments and the security analyses show that the given image encryption algorithm is efficient with higher security. Some comparisons showed that the proposed algorithm outperformed many recent algorithms. Finally, the proposed algorithm may be able to withstand a variety of attacks.

Highlights

  • Multimedia communication has become increasingly useful as information technology and the internet have fast growth

  • Since large amounts of data are carried in digital images and are widely disseminated on the internet, the protection of the data embedded in these images has become a significant and pressing issue

  • In this paper, a new image encryption algorithm based on bit-level permutation and a 2D non-invertible chaotic economic map has been proposed

Read more

Summary

INTRODUCTION

Multimedia communication has become increasingly useful as information technology and the internet have fast growth. Several encryption techniques, methods and algorithms using chaotic maps have been proposed [8]–[12]. THE 2D NON-INVERTIBLE CHAOTIC ECONOMIC MAP In [26], the authors introduced the nonlinear discrete dynamic map which is utilized to represent the dynamics of Cournot Duopoly game. The Cournot Duopoly game consists of two competing firms (or players or companies) and the interaction between those firms gives rise to complex dynamic behaviors that support economic markets with important expectations Such kinds of games are defined by a two-dimensional map that is used to study the dynamic characteristics of such games. The authors calculated the fixed points for the map They examined their stability conditions, which attracted some chaotic behaviors due to the complex dynamics of the map being studied. All parameters are chosen to avoid the periodic windows in the chaotic ranges of the used chaotic economic map (1)

THE PROPOSED ALGORITHM
HISTOGRAM ANALYSIS
CORRELATION ANALYSIS BETWEEN ADJACENT PIXELS
CONCLUSION
Full Text
Paper version not known

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