Abstract

We propose the use of the Jigsaw transform (JT) and the iterative cosine transform over a finite field in order to encrypt and decrypt images. The JT is a nonlinear operation that allows one to increase the security over the encrypted images by adding new keys to the encryption and decryption systems. The finite field is a finite set of integer numbers where the basic mathematical operations are performed using modular arithmetic. The finite field used in the encryption and decryption systems has an order given by the Fermat prime number 257. The iterative finite field cosine transform (FFCT) was used in our work with the purpose of obtaining images that had an uniform random distribution. We used a security key given by an image randomly generated and uniformly distributed. The JT and iterative FFCT was utilized twice in the encryption and decryption systems. The encrypted images presented a uniformly distributed histogram and the decrypted images were the same original images used as inputs in the encryption system. The resulting decrypted images had a high level of image quality in comparison to the image quality of the decrypted images obtained by the actual optical decryption systems. The proposed encryption and decryption systems have three security keys represented by two random permutations used in the JTs and one random image. The key space of the proposed encryption and decryption systems is larger. The previous features of the security system allow a better protection of the encrypted image against brute force and statistical analysis attacks.

Highlights

  • The cosine transform is a very useful mathematical tool that is used in applications of signal and optical processing, such as filtering, encryption, compression and recognition [1,2,3,4,5,6,7,8,9]

  • In order to study the key sensitivity for the three security keys of the proposed encryption and decryption systems, we evaluate the differences between the original image to be encrypted and the decrypted image obtained with a key minimally different from the correct one

  • The resulting number of pixels change rate (NPCR) values vary from 99.52% to 99.65%, these results show that the proposed encryption and decryption system is highly sensitive to small changes in the security keys given by the two random permutations of the Jigsaw transform (JT)

Read more

Summary

Introduction

The cosine transform is a very useful mathematical tool that is used in applications of signal and optical processing, such as filtering, encryption, compression and recognition [1,2,3,4,5,6,7,8,9]. The decrypted images obtained for the decryption system based on the use of FFCT have a high level of image quality in comparison to the image quality of the resulting decrypted images in several optical decryption systems, because the FFCT over a finite field have no rounding and overflow problems [20,21,22]. Another advantage of the FFCT for the encryption system is based on the histogram uniformization of this FFCT over the image to transform [17,18].

Mathematical Background
Image Encryption and Decryption Systems Based on JT and FFCT
Numerical Experiments
Statistical Analysis
Entropy Analysis
Key Space
Differential Attack
Key Sensitivity
Computing Time
Findings
Conclusions
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