Double encryption using trigonometric chaotic map and XOR of an image

Abstract

In the most recent decades, a major number of image encryption plans have been proposed. The vast majority of these plans reached a high security level; however, their moderate speeds because of their complicated processes made them of no use in real-time applications. Inspired by this, we propose another efficient and rapid image encryption plan dependent on the Trigonometric chaotic guide. In contrast to the most of current plans, we utilize this basic map to create just a couple of arbitrary rows and columns. Moreover, to additionally speed up, we raise the processing unit from the pixel level to the row/column level. The security of the new plot is accomplished through a substitution permutation network, where we apply a circular shift of rows and columns to break the solid connection of neighboring pixels. At that point, we join the XOR operation with modulo function to cover the pixels values and forestall any leaking of data. High-security tests and simulation analyses are carried out to exhibit that the scheme is very secure and exceptionally quick for real-time image processing at 80 fps (frames per second).