Chegg$\_2\mathrm{.}2$ Encryption Algorithm Based on Rubik$$s Cube Principle

Write a FULL CODE with no errors in Matlab$($ I have R$2021$b version$)$ for an Secure Image Encryption Algorithm Based on Rubik$$s Cube Principle.

This algorithm is based on the principle of Rubik$$s cube to permute image pixels. To confuse the relationship between original and encrypted images, the XOR operator is applied to odd rows and columns of image using a key. The same key is flipped and applied to even rows and columns of image. ALL STEPS MUST COMPLETED AND HAVE A WORKING CODE AND FINALL CODE MUST RUN WITHOUT ERRORS!

Step $1$: Read$/$Load the input image $-$ Display the input image

Step $2$: Convert to grayscale if it's a color image $+$ Normalize the image to the range $[0,1]+$ Display the input image

Step $3$:Define and Initialize Rubik$$s Cube Principle, pecify the specific equations govering Rubik$$s Cube Principle.and the parameters involved $+$ Set parameters for Rubik$$s Cube Principle

Step $4$: Initialize and Generate Set parameters for Rubik$$s Cube Principle sequences $-$you need to write and implement the part to generate sequence for Set parameters for Rubik$$s Cube Principle

Step $5$: Encryption process, Perform image encryption using the chaotic sequences: Write and implement the Ruik's Cube Principle encryption

For example, for the Rubik's cube principle, you may need to$.$After encryption result a file$($image$)+$ Write the image file on disk $+$ Display the encrypt image.

Step $6$: Decryption process, Perform image decryption $+$ Write the image file on disk $+$ Display the decrypted image

Step $7$: Calculate performance metrics $-$ You need to implement functions to calculate the metrics like: PSNR$,$ entropy, NPCR$,$ UACI, horizontal, vertical, and diagonal pixel correlation.

Step $8$: Display all the saved results : PSNR$,$entropy$,$ NPCR$,$UACI$,$ horizontal, vertical, diagonal pixel correlation.

You would then need to integrate these into the encryption process based on the Rubik's Cube principle and subsequently develop the decryption algorithm. After that, ensure all metrics can be computed accurately for assessing the performance of your encryption algorithm.

After write all code, choice any picture and load in this altgoritm and RUN the code in Matlab. IF ONLY it works, then write me the ANSWER! $-($ALL FUNCTION CODE MUST RUN PERFECT, NO errors in all code$)$for thumb UP$!$

$\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

a$)$ Rubik$$s Cube Image Encryption

Let Io represent an $\backslash$alpha $-$bit gray scale image of the size M xN$.$ Here, Io represent the pixels values matrix of image Io$.$ The steps of encryption algorithm are as follows:

$(1)$ Generate randomly two vectors KR and KC of length M and N$,$ respectively. Element KR$($i$)$ and KC$($ j$)$ Note that both KR and KC must not have constant values.$(2)$ Determine the number of iterations, ITERmax, and initialize the counter ITER at $0.(3)$ Increment the counter by one: ITER $=$ ITER $+1.(4)$ For each row i of image Io$,($a$)$ compute the sum of all elements in the row i$,$ this sum is denoted by $\backslash$alpha $($i$).($b$)$ computemodulo $2$ of $\backslash$alpha $($i$),$ denoted by M$\backslash$alpha $($i$).($c$)$ row i is left, or right, circular$-$shifted by KR$($i$)$ positions $($image pixels are moved KR$($i$)$ positions to the left or right direction, and the first pixel moves in last pixel.$),$ according to the following: if M$\backslash$alpha $($i$)=0->$ right circular shift $,$ else $->$ left circular shift. $(5)$ For each column j of image Io: a$)$ compute the sum of all elements in the column j$,$ this sum is denoted by $\backslash$beta $($ j$),($b$)$ computemodulo $2$ of $\backslash$beta $($ j$),$ denoted by M$\backslash$beta $($ j$).($c$)$ column j is down, or up$,$ circular$-$shifted by KC$($i$)$ positions, according to the following: if M$\backslash$beta $($ j$)=0->$ up circular shift $,$ else $->$ down circular shift.Steps $4$ and $5$ above will create a scrambled image, denoted by ISCR.$(6)$ Using vector KC$,$ the bitwise XOR operator is applied to each row of scrambled image ISCR using the

following expressions:where $$ and rot $180($KC$)$ represent the bitwise XOR operator and the flipping of vector KC from left to right, respectively.$(7)$ Using vector KR$,$ the bitwise XOR operator is applied to each column of image I$1.(8)$ If ITER $=$ ITERmax, then encrypted image IENC is created and encryption process is done; otherwise,the algorithm branches to step $3.$Vectors KR$,$ KC and the max iteration number ITERmax are considered as secret keys in the proposed encryption algorithm. However, to obtain a fast encryption algorithm it is preferable to set ITERmax $=1($single iteration$).$ Conversely, if ITERMAX $>1,$ then the algorithm is more secure because the key space is larger than for ITERMAX $=1.$ Nevertheless, in the simulations presented in Section $3,$ the number of iterations ITERmax was set to one.

b$)$ Rubik$$s Cube Decryption Algorithm.

The decrypted image,Io$,$ is recovered from the encrypted image, IENC, and the secret keys, KR$,$ KC$,$ and ITERmax as follows in the following: $(1)$ Initialize ITER $=0.(2)$ Increment the counter by one: ITER $=$ ITER $+1.(3)$ Use bitwise XOR $.$