No abstract

<p class="0abstract">This paper describes the development of encryption algorithms using the magic square of order 5 and Multi-level keys with the addition of Matrix keys to increase implementation speed and complexity. This work relied mainly on the magic sum and some equations that were added as an improvement on previous work. Multi-level keys were used for three different message sizes, and an additional key matrix with size 5×5 was used to add more complexity. The proposed work was performed using both GF(P) and GF(2⁸). Results were compared with the MS3, they have been found good, with acceptable speed and high complexity where it was (P)⁹ × (256)¹⁶ in the first algorithm, (P)⁹ × (256)¹⁶ × 3 in the second algorithm, and (P)⁹ × (256)¹⁶ × 3 × (P)²⁵ in the third algorithm, the complexity changed according to the chosen value of N randomness, in addition to speed, complexity, NIST calculations have been performed for texts and histogram calculations for different images were calculated and compared as well.</p>

This paper has been developed to compare encryption algorithms based on individual magic squares and discuss the advantages and disadvantages of each algorithm or method. Where some positions of the magic square are assigned to the key and the remaining positions are assigned to the message, then the rows, columns and diagonals are summed and these results are as ciphertext and in the process of decryption the equations are arranged and solved by Gauss elimination metod. All algorithms were applied to encrypte the text and images, as well as using both GF(P) and GF(28), and the speed and complexity were calculated. The speed of MS9 by using GF(P) is 15.09085 Millie Second, while by using GF(28) it will be 18.94268 Millie Second, and the complexity is the value of the ASCII code raised to the exponent of the number of message locations multiplied by the value of the prime number raised to the exponent of the number of key locations.

This paper use the magic square of order 7 to develop Block encryption algorithms that work for encoding color images and text in GF(P) and GF(28). The algorithm use key with length = 35 and a message with length =14 are used, First, the keys are placed in the previously agreed positions and the remaining positions remain for the message, then the magic sum for each of them is calculated. Complexity, velocity, NIST calculations, and histogram calculations were calculated and the results were compared with the 5th degree magic square, where the complexity was with using GF(P) = (256)14 × (P)35 and using GF(28) = (256)14 × (256)35, The magic square of the seventh degree is better than the magic square of the fifth degree in cryptography in terms of complexity and a slight difference in speed.