A novel image encryption scheme based on quantum dynamical spinning and rotations.

Quantum information processing made a tremendous and remarkable impact on number of classical mechanic's problems. The impact does not only stop at classical mechanics but also the cyber security paradigm. Quantum information and cryptography are two classes of quantum information processing which use the idea of qubits instead of bits as in classical information security. The idea of fast computations with multiple complexity level is becoming more realistic in the age of quantum information due to quantum parallelism where a single quantum computer does allow to compute hundreds of classical computers with less efforts and more accuracy. The evolution of quantum information processing replaces a number of classical mechanic's aspects in computational and cyber security sciences. Our aim here is to introduce concepts of applied quantum dynamics in cryptography, which leads to an evolution of quantum cryptography. Quantum cryptography is one of the most astonishing solicitations of quantum information theory. To measure the quantum state of any system is not possible without disturbing that system. The facts of quantum mechanics on traditional cryptosystems lead to a new protocol and achieving maximum remarkable security for systems. The scope of this paper is to design an innovative encryption scheme for digital data based on quantum spinning and rotation operators.

1. Introduction

Today, we are in the sphere of digitally advanced era, where huge information is transmitted over insecure line of communication. Nowadays information of any social media servers, military organizations, banks and other private sectors are placed and maintained in very big databases. The illegal sharing of information through any digital medium brings a serious damage to any organization. The existing world is facing many problems due to digitally advancement in numerous applications. Therefore, the security and secrecy of digital contents have become one of the inevitable issues. The existing world is fundamentally an era of continuous digital images. These digital contents play significant role in our life. Digital images have precise possessions like redundancy and resilient connection among the adjacent pixels which make it difficult for the outdated encryption algorithms like IDEA, DES, AES, RSA and ElGamal to handle the real time enciphering due to requirement of high computational efficiency. Different types of techniques were developed in literature in order to secure these digital images. Some techniques use chaos theory to develop a complete encryption schemes which consist of confusion as well as diffusion with multiple round [1-13]. Also some researcher designed new and innovative methodologies in order to construct a nonlinear component of block ciphers which are surely responsible for the confusion in any block cipher [14-19].

The idea of quantum computers is now evolving nowadays which is a serious threat to classical cryptographic algorithms. The fundamental principle of quantum computers is to transform the input information states which can be signified by linear combination of different related inputs to conforming different related outputs. Quantum schemes are equivalent to a circuit comprises of quantum gates which act on qubits [20-22].

Physical executions of the qubits and their relating entryways have been presented in [23,24]. At present, quantum calculation has been connected in numerous science branches and innovation for instance image processing, pattern recognition, quantum games and computational geometry. The conceivable quantum machines will debilitate the traditional cryptosystem on a fundamental level using mechanical properties for instance superposition and entanglement. Quantum cryptography plans have been believed to be useful to best the downsides of traditional cryptosystem in light of quantum physical standards such as no-cloning hypothesis and Heisenberg vulnerability [25-34].

With the advancement in technology in modern era of computer world, brute force attack will be quite easily performing in quantum computers which are based on quantum information theory. This vulnerability gives potential danger to idealize security required at national security and protected innovation level. Rather than relying upon the many-sided quality of factoring large numbers, quantum cryptography gives major and constant standards of quantum mechanics. It depends on two basic principles of theoretical physics namely the Heisenberg uncertainty standard and the photon polarization. It depicts how light photons can have enraptured in particular ways. Photon channel with the right polarization can just distinguish a captivated photon.

One-path ness of photons alongside the Heisenberg uncertainty guideline which give birth to quantum cryptography is an alluring alternative to guarantee the security and overcoming spies [35-48]. Few particles similar to electrons, quarks and neutrinos have half inner angular momentum, likewise termed spin. In this paper we build up a spinor portrayal for half spin to give another bearing to cryptography by means of spinning operators of quantum dynamics. The purposed of half spinning operator is twofold, firstly we encrypt the keys and secondly digital image can likewise be encoded by means of this newly designed mechanism. The secret is in our scheme is phase data; we utilize it to scramble and decode the image parameters. To accomplish most extreme security, we can utilize diverse stages for keys and messages. To unscramble the message, to begin with, we need to decode the keys by utilizing stage data and after that by utilizing keys with stage data of the message to unscramble the message. In the event that anybody takes one of the variables (keys or period of keys or period of the message), again he ought not to have the capacity to unscramble the message without knowing alternate components.

This paper is organized in 6 sections. Section 2 is devoted for basic quantum rotation operators. We discuss our proposed algorithms for image encryption in section 3. The experimentation of our proposed work is discussed in section 4. The security and performance analyses for the proposed scheme is discussed in section 5. The differential analyses are also explained in this section for proposed algorithms in order to testify the resistance of suggested schemes against differential analysis. Finally, conclusion is given in section 6.

2. Mathematical expression for rotation operators

The detail derivations of rotation and spinning are available in [39-40]. The mathematical expression for rotation operators are given below which will be helpful while designing image encryption technique:

3. Proposed digital image encryption algorithm

The size of plain image g(i,j) is M×N, where g(i,j) is pixel value at i row and j column. The proposed scheme refers both confusion and diffusion. The procedure for image encryption is shown in Fig 1. The mathematical expressions of rotational operators in two dimensions are given below that will be helpful for the development of our proposed image encryption algorithm.

Fig 1

Proposed encryption algorithm.

Let entangle 2×2 matrices of Eq (4) to form the set M of 4×4 entangle matrices. The elements of the set M are:

We will get 24 matrices M = {M1,M2,M3,…,M24}.

Read an image and transform each layer of image (RGB) to 4×n order.

Decide criteria to choose phase for encryption known to sender and receiver.

Put phase in Eq (5) to get matrices M from set M.

Choose key of any length [a b c d …] under mod 24 and take its regarding matrix / matrices from set M of Eq (5).

Encrypt each layer of digital image with selected rotational matrices.

Transform the dimensions of encrypted layers to as original.

Combine all the encrypted layers to form an encrypted image in RGB.

We can also decide criteria to encrypt the key: Suppose n ∈ [a, b, c, d, …] and if the key digits odd [a b c], calculate n+1/2, which equals b here, convert b to binary and check if the last bit of b is 0, choose matrix regarding a to encrypt the key else choose matrix regarding c to encrypt the key. If the key digits even [a b c d e f ], calculate n/2, which is equals c here, convert c to binary and check if the last bit of c is 0, choose matrices regarding [a b] to encrypt the key else choose matrices regarding [d e f] to encrypt the key.

Read RGB encrypted image and transform it into 4×n order.

Extract the RGB layers from encrypted Image.

Calculate the phase decided by equation and put in set M of Eq (5).

Now extract the original keys from encrypted keys and take regarding matrix/ matrices from set M and find their inverse.

Decrypt each layer with inverse matrix/ matrices.

Transform the dimensions of layers as received in encrypted.

Combine all the layers to form an image as was in original.

4. Experimentation of proposed algorithm

Suppose we would like to encrypt the Image of 'Lena', 'Fruits' and ‘Parrot’ of dimension 512×512 with key [1 3 7 14 29 59] and then we perform different analysis.

We choose the image of 'Lena', ‘Fruits’ and ‘Parrot’ and extract its RGB layers and perform analysis.

We decide the secret equation to choose the phase at both side is:

By using this equation, we have θ = 382.5. As the described algorithm refers symmetric cryptography, we will decide the key secretly. But if we want more security, we can also decide some criteria regarding key (explained in step 8 of image encryption algorithm). As the key length n = 6 (even), n/2 =3, so the 3rd term of key is 7 and last digit of its binary is 1. Therefore, we select different matrices from set M based on the modulus operations are: 14 mod 24 = A14, 29 mod 24 = A5, 59 mod 24 = A11. Now transform the matrices A14, A5, A11 regarding dimension of key by appending zeros and apply calculated phase. The image encryption with given key as follow (see Table 1):

Table 1

Key matrices for image encryption by using rotation and spinning operators.

Key	Key Matrices	Cipher images
1 mod 24 = 1	M1	C1	M1 × (IR, IG, IB )
3 mod 24 = 3	M3	C2	M3× C1
7 mod 24 = 7	M7	C3	M7× C2
14 mod 24 = 14	M14	C4	M14× C3
29 mod 24 = 5	M5	C5	M5× C4
59 mod 24 = 11	M11	C6	M11× C5

5. Performance analysis of proposed algorithm

We have completed a few measures on standard digital images to testify the security and execution of suggested encryption algorithm. These measures comprise of factual examination, sensibility investigation and irregularity test for the encrypted images. Each of these measures discussed in detail in the accompanying subsections.

5.1 Randomness test for cipher

The security of cryptosystem must have a few possessions for instance long period, uniform distribution, high intricacy and productivity. With a specific end goal to fulfill these prerequisites, we used NIST SP 800–22 for testing the haphazardness of digital images. A portion of these tests comprise of various subsets. The scrambled Lena 24-bit digital image is utilized to complete all NIST tests. To test the figure haphazardness, great deals of beginning keys are utilized. The aftereffects of the tests are appeared in Table 2. By breaking down theses outcomes, it can be derived our anticipated digital image encryption mechanism effectively passes the NIST tests. Consequently, in light of the accomplished outcomes, the produced random ciphers in our encryption algorithm can be asserted that are very irregular in its output.

Table 2

NIST test results for encrypted image.

Test		P–values for color encryptions of encrypted images	Results
		Red         Green         Blue
Frequency		0.16410         0.46703         0.25495	Pass
Block frequency		0.64862         0.53145         0.17988	Pass
Rank		0.29191         0.29191         0.29191	Pass
Runs (M = 10,000)		0.21762         0.90595         0.54043	Pass
Long runs of ones		0.67514         0.71270         0.71270	Pass
Overlapping templates		0.85988         0.85988         0.85988	Pass
No overlapping templates		0.92285         0.54825         0.99989	Pass
Spectral DFT		0.88464         0.38399         0.029523	Pass
Approximate entropy		0.16074         0.33744         0.69469	Pass
Universal		0.99445         0.99292         0.99659	Pass
Serial	p values 1	0.17143         0.039989         0.65972	Pass
Serial	p values 2	0.87464         0.006063         0.98104	Pass
Cumulative sums forward		0.3647         0.34767         0.35256	Pass
Cumulative sums reverse		0.35221         0.89099         0.77967	Pass
Random excursions	X = -4	0.57183         0.0001427         0.97465	Pass
	X = -3	0.15716         0.40359         0.95603	Pass
	X = -2	0.099872         0.54469         0.89146	Pass
	X = -1	0.29907         0.47837         0.88326	Pass
	X = 1	0.0037788         0.75769         0.85692	Pass
	X = 2	0.0027926         0.43307         0.082712	Pass
	X = 3	0.10337         0.67278         0.68683	Pass
	X = 4	0.2619         0.66907         0.1332	Pass
Random excursions variants	X = -5	0.4330         0.45637         0.53288	Pass
	X = -4	0.48074         0.90043         0.47950	Pass
	X = -3	0.4907         0.081938         0.402778	Pass
	X = -2	0.57415         0.035518         0.28009	Pass
	X = -1	0.29168         0.21445         0.18145	Pass
	X = 1	0.00066         0.24660         0.78927	Pass
	X = 2	0.001451         0.47354         0.87737	Pass
	X = 3	0.01364         0.31764         0.90486	Pass
	X = 4	0.039974         0.15018         0.91954	Pass
	X = 5	0.065987         0.19477         0.47603	Pass

5.2 Uniformity of pixels

A standout amongst other remarkable highlights for estimating the security of digital content encryption framework is histograms uniformity of enciphered contents [24]. We have taken three 256 dark level digital images of size 512×512 that have diverse substance and their histograms are computed. As for Figs 2–4, the histograms of plain-pictures contain extensive sharp ascents took after by sharp decreases and the histograms of all encipher images under the anticipated scheme is genuinely uniform and essentially not quite the same as that of the original image, which makes measurable assaults troublesome. Subsequently it does not give any insight to be utilized in a measurable examination assault on the enciphered digital image (see Figs 5–7).

Fig 2

Plain and encrypted layer wise images of Lena.

(a) plain Lena image. (b) Red component. (c) Green component. (d) Blue component. (e) Encrypted Lena image. (f) Encrypted Red component. (g) Encrypted Green component. (h) Encrypted Blue component.

Fig 4

Plain and encrypted layer wise images of Parrot.

(a) plain Parrot image. (b) Red component. (c) Green component. (d) Blue component. (e) Encrypted Parrot image. (f) Encrypted Red component. (g) Encrypted Green component. (h) Encrypted Blue component.

Fig 5

Histograms of Lena image of size 512×512.

(a) plain image histogram. (b) Red component histogram. (c) Green component histogram. (d) Blue component histogram. (e) Encrypted image histogram (f) Encrypted Red component histogram. (g) Encrypted Green component histogram (h) Encrypted Blue component histogram.

Fig 7

Histograms of Parrot image of size 512×512.

(a) plain image histogram. (b) Red component histogram. (c) Green component histogram. (d) Blue component histogram. (e) Encrypted image histogram (f) Encrypted Red component histogram. (g) Encrypted Green component histogram (h) Encrypted Blue component histogram.

Plain and encrypted layer wise images of Fruits.

(a) plain Fruit image. (b) Red component. (c) Green component. (d) Blue component. (e) Encrypted Fruit image. (f) Encrypted Red component. (g) Encrypted Green component. (h) Encrypted Blue component.

Histograms of Fruits image of size 512×512.

5.3 Pixels correlation test

It is notable that adjoining picture pixels are exceedingly associated either in horizontal, vertical or corner to corner directions. Hence, protected encrypted plan should evacuate this relationship to enhance obstruction against measurable investigation. To test the relationship between neighboring pixels in plain and encrypted image, the accompanying method was completed. Initial, 10000 sets of two nearby pixels from plain and encrypted image were arbitrarily chosen [25, 26]. At that point correlation coefficients of each combine pairs were ascertained utilizing the accompanying mathematical expression: where xandy are values of two adjacent pixels at gray scale in the image, σ is the covariance, and are variances of random variable x and y respectively. The correlation coefficients of plain and cipher images have different contents conveyed in Tables 3 and 4 related to plain and cipher images given in Figs 8–10. Moreover, the quantitative analysis for correlation coefficient is discussed in Table 3, which shows the correlation distribution of original and encrypted images in horizontal, vertical and diagonal directions.

Table 3

Correlation coefficients of plain and cipher images.

Standard images	Plain			Encrypted (Proposed Scheme)			Ref. [14]
	Horizontal	Vertical	Diagonal	Horizontal	Vertical	Diagonal	Horizontal         Vertical         Diagonal
Lena	0.9740	0.9868	0.9612	-0.0113	-0.0093	0.0027	0.0141         0.0107         0.0097
Fruits	0.9753	0.9757	0.9567	-0.0129	-0.0155	0.0012	-         -         -
Parrot	0.9566	0.9434	0.9260	-0.0108	-0.0141	0.0054	-         -         -

Table 4

Comparison of the correlation coefficient of proposed scheme with recent techniques using Lena image.

	Correlation Directions
	Horizontal	Vertical	Diagonal
Plain image	0.9740	0.9868	0.96120
Proposed encryption scheme	-0.0113	-0.0093	0.00270
Ref. [7]	0.01089	0.01811	0.00610
Zhang et. Al. [8]	0.08200	0.04000	0.00500
Zhou et. al. [9]	0.012	0.02700	0.00700
Ref. [10]	0.01589	0.06538	0.03231
Mao et. al. [11]	0.04500	0.02800	0.02100
Etimadi et. al. [12]	0.005	0.01100	0.02300

Fig 8

Correlation coefficient between pixel pairs for original and encrypted Lena image.

(a) Plain Lena image. (b) Horizontal correlation. (c) Vertical correlation. (d) Diagonal correlation. (e) Encrypted Lena image. (f) Encrypted Horizontal correlation. (g) Encrypted Vertical correlation. (h) Encrypted Diagonal correlation.

Fig 10

Correlation coefficient between pixel pairs for original and encrypted Parrot image.

(a) Plain Parrot image. (b) Horizontal correlation. (c) Vertical correlation. (d) Diagonal correlation. (e) Encrypted Parrot image. (f) Encrypted Horizontal correlation. (g) Encrypted Vertical correlation. (h) Encrypted Diagonal correlation.

Correlation coefficient between pixel pairs for original and encrypted Fruit image.

(a) Plain Fruit image. (b) Horizontal correlation. (c) Vertical correlation. (d) Diagonal correlation. (e) Encrypted Fruit image. (f) Encrypted Horizontal correlation. (g) Encrypted Vertical correlation. (h) Encrypted Diagonal correlation.

5.3.1 Correlation between original and encrypted images

The correlation between various pairs of original/ encrypted images analyzed here by computing the 2D coefficients of correlation between original and encrypted images [45]. The following equation is employed to calculate the correlation coefficients. where X and Y represents the plain and cipher image, and are the mean values of X and Y, M is the height and N is the width of original / encrypted images. In Table 3, we have estimated correlation coefficients for the plain and cipher images in all three directions. The correlation coefficients of encryption pointed out in fourth, fifth and sixth columns. The correlation coefficients among various pairs of plain and cipher images are very small or practically zero, therefore the plain and cipher images are significantly different. Additionally, the evaluation of the correlation coefficient of anticipated process with modern approaches using Lena image given in Table 4. The results of our offered scheme have lower values of correlation coefficient which qualify for an efficient technique for image enciphering in real time applications.

5.4 Pixel difference analysis

The image quality assessment based on pixel difference method has been done by calculating PSNR and MSE value. They are the error metrics used to compare different images.

5.4.1 MSE and PSNR analysis

A scrambled digital image ought to be essentially not the same as the plain image. We compute the mean square error (MSE) between the original and enciphered images to measure the level of enciphering. MSE is characterized as follow: where P and C allude to pixels situated at i row and j column of unique digital and scrambled image separately. Larger the MSE esteem, better the encryption security. The encrypted image quality is assessed utilizing PSNR (peak signal to noise ratio) which is depicted by the following expression. where I is the greatest pixel estimation of image. The PSNR ought to be low esteem when compares to the immense distinction between plain and ciphered image. The viability of proposed strategy, assessed as far as MSE and PSNR for every one of the three digital images, is presented in Table 5.

Table 5

Pixel difference based measures of proposed encryption scheme.

Images	Pixel difference based measures
	MSE	PSNR
Lena	4859.03	11.30
Fruits	6399.05	10.10
Parrot	7274.44	9.55

5.5 Three dimensional color intensity of plain and encrypted images

The intensity of color coordinates (RGB) controls the pixel appearance. The color depth is determined by the amount of information stored in a pixel. Color depth controls pixel colors and can also be called bit depth. We show here the total number of pixels corresponding to the intensity level over image (see Figs 11–13). The 3D histograms for plain images consists of sharp peaks in the pixel’s distribution whereas in cases of encrypted images, the 3D color intensities are quite uniform making a flat plan in RGB coordinates. These three dimensional figures suggest that our anticipated image encryption scheme is quite robust and giving no clue to eavesdropper to access or estimate any information from the encrypted image pixels’ uniform distribution.

Fig 11

Three dimensional color intensity histograms of Lena image of size 512×512.

(a) 3D plain image histogram. (b) Red component histogram in 3D. (c) Green component histogram in 3D. (d) Blue component histogram in 3D). (e) 3D Encrypted image histogram. (f) Encrypted Red component histogram in 3D. (g) Encrypted Green component histogram in 3D. (h). Encrypted Blue component histogram in 3D.

Fig 13

Three dimensional color intensity histograms of Parrot image of size 512×512.

(a) 3D plain image histogram. (b) Red component histogram in 3D. (c) Green component histogram in 3D. (d) Blue component histogram in 3D). (e) 3D Encrypted image histogram. (f) Encrypted Red component histogram in 3D. (g) Encrypted Green component histogram in 3D. (h). Encrypted Blue component histogram in 3D.

Three dimensional color intensity histograms of Fruit image of size 512×512.

5.6 Entropy investigation

Entropy is the most leading feature of randomness [21, 27, 28]. Specified a source of independent random events from set of possible discrete events {y, y,…, y} with associated probabilities {p(y), p(y),…, p(y)}, the average per source output information called entropy of source.

The y in this condition is called source images and 2 is the aggregate conditions of data. For absolutely irregular source emanating 2 signs, entropy ought to be N. For perfectly indiscriminate digital content, the estimation of ideal data entropy is 8. Various plain and cipher images entropies accounted in Table 6 as indicated by the original images of Figs 2–4. These entropy esteems are near the hypothetical esteem 8. This implies data leakage in encryption procedure is irrelevant and the mechanism is protected upon entropy attacks. We have compared information entropy of our suggested encryption technique with already developed schemes. The entropy of the proposed scheme for encrypted Lena image is superior to existing algorithm on comparing, see Table 7 [13].

Table 6

Information entropies of original and encrypted images.

		Color component of plain image				Color component of encrypted image
Image	Plain Image	Red	Green	Blue	Encrypted image	Red Green Blue
Lena	7.7502	7.2633	7.5909	6.9798	7.9988	7.9977 7.9978 7.9978
Fruits	7.6868	7.1466	7.4330	7.7588	7.9984	7.9980 7.9980 7.9979
Parrot	7.1412	7.1803	7.7031	5.9653	7.9998	7.9981 7.9975 7.9976

Table 7

Comparison results for information entropies of Lena image of size 512×512.

Algorithm	Entropy
Proposed	7.9988
Sun’s algorithm [13]	7.9965
Baptista’s algorithm [13]	7.9260
Wong’s algorithm [13]	7.9690
Xiang’s algorithm [13]	7.9950

5.7 Robustness against differential attack

To make our image encryption technique more robust against differential assault, we require an adjustment in digital plain image (for instance an adjustment in one pixel), which brings about modification of the entire comparing encrypted image with a likelihood of a half pixel changing. We demonstrate that our scheme has adequate affectability to plain image. A change in i block of permutated digital image effects on i block of encrypted image straightforwardly. Anyway the change has no impact in the previous scrambled blocks and its impact is low and step by step vanishes in the ensuing blocks. Since i block just impacts on one pixel of (i+1) block, i.e. D, and has not immediate impact in the following blocks. With a specific end goal to gauge impact of a slight difference in digital plain contents on its encrypted, the number of pixels change rate (NPCR) bound together to found the UACI (unified average intensity) and mean absolute error (MAE) are proposed. Let C(i,j) and P(i,j) are the gray level pixels at the i row and j column of M×N plain and cipher images respectively, and MAE is defined as:

Enhanced the encryption security by higher the MAE esteem. To testify the impact of changing a single pixel in plain image and overall encrypted image with the proposed scheme, the two basic measures can be utilized; NPCR and UACI. We consider two encoded images whose source image just varies by one pixel. The NPCR and UACI can be evaluated by using the following mathematical expressions, if the first image is represented as C1(i,j) and the second image as C2(i,j). where

The encryption security is better by larger the UACI value. The plain image is encrypted first in order to evaluate the plain image sensitivity, then one pixel is randomly selected and changed in plain image.

Tables 8–10, provide the data of experimental results of our proposed scheme, while MAE values shown in the last column of Tables 8 and 9.

Table 8

The estimate of sensitivity analysis of proposed image encryption scheme.

Test images	NPCR			UACI			MAE
	Max	Min	Mean	Max	Min	Mean
Lena	99.997	99.612	99.713	34.43	33.21	33.87	79.22
Fruits	99.994	99.515	99.698	33.98	33.02	33.71	83.45
Parrot	99.998	99.597	99.869	33.53	33.11	33.24	75.38

Table 10

Comparison of differential attacks analysis for standard Lena image of size 512×512.

Standard Lena Image	Suggested	Ref. [2]	Ref. [3]	Ref. [4]	Ref. [5]	Ref. [6]	Ref. [14]
UACI	0.3393	0.3362	0.3360	0.3351	0.3351	0.3342	0.3351
NPCR	0.9968	0.9961	0.9963	0.9961	0.9960	0.9967	0.9961

Table 9

The assessment of sensitivity analysis for color components.

Test image	NPCR				UACI			MAE
	Red	Green	Blue	Red	Green	Blue	Red	Green	Blue
Lena	99.88	99.73	99.79	33.33	32.91	33.88	82.78	77.88	81.78
Fruits	99.67	99.89	99.65	33.11	33.04	33.21	76.36	86.34	88.98
Parrot	99.82	99.91	99.87	33.27	33.16	33.45	79.87	65.23	69.88

Tables 8–10 analyze the source of MAE, MPCCR and UACI between various plans. It demonstrates the NPCR esteems are constantly equivalent to the perfect estimation of 1 and UACI esteem is more than 34%. This outcome shows that anticipated scheme has a great degree touchy to an insignificant change in original image, regardless of whether the two scrambled plain image have 1-bit difference, the two unscrambled/ enciphered images will be quite different from each other. Accordingly, the projected design has a superior capacity to hostile to differential attacks in examination with alternate schemes. The magnificence and flexibility of outlined algorithm are to change in any term prompt change the cipher image, and encrypted image cannot be unscrambled by just single matrices and phase θ. To decode the encrypted, we should know the two matrices as well as phase θ. As θ has vast focuses and a smidgen change in the stage like 0.01, enciphered image would be changed. Also we have compared our results of NPCR and UACI with already exiting some well-known results [2-6]. The proposed scheme has very high resistance against differential and linear attacks and having closed agreement with results therein references [2-6].

6. Conclusion

In this research article, we designed a new encryption technique which is based on quantum rotation operators. We have utilized the quantum half spinning in order to add confusion and diffusion capabilities in our proposed schemes. We can expand or compress the key by just multiplying with any nonsingular matrix of [4×n] known to sender and receiver to make confusion for cryptanalyst. It will be almost impossible for cryptanalyst to crack the key and message, because no one knows what matrices being multiplied from set M, either 2 matrices or more than 2 matrices (challenge for crackers). The described algorithm refers to half spinning, therefore the points in between −720° to 720° are infinite and possible combinations of rotation matrices are 4!. By using statistical analysis for our anticipated algorithm, it is recommended that the proposed algorithm is a good contender for image encryption.