Information security is one of the important issues in the information age, image encryption algorithms have been increasingly studied to guarantee the secure image transmission over the internet and through wireless networks. In this article, we propose a new approach for image encryption based on polar decomposition and orthogonal matrices. This scheme offers good confusion and diffusion qualities. The proposed algorithm is shown to be secure against important cryptanalytic attacks (statistical attacks, sensitivity dependence, differential attacks, brute force attacks...), theoretical analysis and computer simulations both confirm that it has a high security level.

Encryption is the way to ensure confidentiality of different data, digital images have special features as large data, bulky data, and strong correlation between pixels, which makes traditional encryption algorithms not suitable for image encryption. For this concern, we propose a novel lossless encryption scheme for digital images based on combination of matrix transformations and XOR operation. The numerical experimental results confirms that the proposed method achieves high security level against brute force attacks, statistical attacks and sensitivity analysis, moreover the suggested algorithm provides a good randomness properties, thus our method can be applied for image encryption and transmission in sensitive domains.

Encryption is the way to ensure confidentiality of different data, digital images have special features as large data, bulky data, and strong correlation between pixels, which makes traditional encryption algorithms not suitable for image encryption. For this concern, we propose a novel lossless encryption scheme for digital images based on combination of matrix transformations and XOR operation. The numerical experimental results confirms that the proposed method achieves high security level against brute force attacks, statistical attacks and sensitivity analysis, moreover the suggested algorithm provides a good randomness properties, thus our method can be applied for image encryption and transmission in sensitive domains.

Security is an important issue in image storage and communication, encryption is one of the most common ways to ensure security. Recently, many schemes based on chaotic map have been proposed, but most of this method suffers from small key space, which makes them vulnerable to brute forces attacks. In this study, we design a highly robust novel symmetric image encryption scheme which offer good confusion and diffusion qualities, and a large key space to ensure popular security factor and to overcome the weaknesses of the state of the art encryption schemes. In the security analysis section, we prove that our scheme can resist most known attacks, such as cipher image only attack, known and chosen plain image attacks, differential and exhaustive attacks. It is shown in this paper that the use of polar decomposition with chaotic map can gives a fast and secures encryption.

Security is an important issue in image storage and communication, encryption is one of the most common ways to ensure security. Recently, many schemes based on chaotic map have been proposed, but most of this method suffers from small key space, which makes them vulnerable to brute forces attacks. In this study, we design a highly robust novel symmetric image encryption scheme which offer good confusion and diffusion qualities, and a large key space to ensure popular security factor and to overcome the weaknesses of the state of the art encryption schemes. In the security analysis section, we prove that our scheme can resist most known attacks, such as cipher image only attack, known and chosen plain image attacks, differential and exhaustive attacks. It is shown in this paper that the use of polar decomposition with chaotic map can gives a fast and secures encryption.