Abstract

Due to the importance of data security at present, an encryption algorithm based on the principle of non-commutative group, hash function, and E-fractal has been proposed. Key generation depends on the array values generated by the braid group and using them as input to the SHA-3 (256) which increases the strength of the key because it generates values in one direction only. The results of the hash function are determined by the Lorenz hyper-chaotic system initial values, and four image-size arrays are generated as the final image-encryption keys using the RC4 algorithm. Then the use of the E-fractal diffusion method. To bolster the security of the encryption, it is employed to disperse the pixel values., adopting the control word that increases the randomness of the data. The security analysis of the proposed encryption algorithm demonstrates that it is difficult to decipher due to the presence of the hash function in addition to its easy implementation within seconds, and the efficiency scale was calculated that showed its strength in effectively resisting attacks by others.

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