Implementation of modified GSO based magic cube keys generation in cryptography

Abstract

Over the last few decades, tremendous and exponential expansion in digital contents together with their applications has emerged. The Internet represents the essential leading factor for this expansion, which provides low-cost communication tools worldwide. However, the main drawback of the Internet is related to security problems. In order to provide secure communication, enormous efforts have been spent in the cryptographic field. Recently, cryptographic algorithms have become essential for increasing information safety. However, these algorithms require random keys and can be regarded as compromised when the random keys are cracked via the attackers. Therefore, it is substantial that the generation of keys should be random and hard to crack. In this paper, this is guaranteed via one of the most efficient nature-inspired algorithms emerged by inspiring the movements of stars, galaxies, and galaxy superclusters in the cosmos that can be utilized with a mathematical model (magic cube) for generating hardly cracking random number keys. In the proposed cryptographic system, the Modified Galactic Swarm Optimization (GSO) algorithm has been utilized in which every row and column of magic cube faces are randomly rotated until reaching the optimal face, and the optimal random elements are selected as optimal key from the optimal face. The generated optimized magic cube keys are used with several versions of RC6 algorithms to encrypt various secret texts. Furthermore, these generated keys are also used for encrypting images using the logical XOR operation. The obtained results of NIST tests proved that the generated keys are random and uncorrelated. Moreover, the security of the proposed cryptographic system was proved

A Comparative Study of Researches Based on Magic Square in Encryption with Proposing a New Technology

“…The use of magic squares in encryption mainly depends on the known features of magic squares, but the difference is that the magic sum is not required to be equal for each row sum, column sum, or diameter sum [10].…”

“…Invertible matrix has been adopted in advanced encryption, which has been considered as a time-consuming process. The search based on magic squares has been developed to speed up time and get rid of the time consumption, and at the same time, it depends on matrices as well [10].…”

Developed Lightweight Cryptographic Algorithms for The Application of Image Encryption: A Review

“…The implementation of cryptography has helped different information forms for being legally accessed via an authentic user with the assist of its typical processes of encryption. But, there are several differences when implementing encryption on ordinary files and on digital images [11]. The pixels' contents inside any digital image are infinite and so, the encryption algorithm relies on the sampling process as well.…”