"A Comparison Between Odd Magic Squares Use In Cryptographic Algorithms" by Ibrahim Malik Alatta and Abdul Monem S. Rahma

Article Title

A Comparison Between Odd Magic Squares Use In Cryptographic Algorithms

Authors

Ibrahim Malik Alatta, Department of Computer Science, University of Technology, Baghdad, IraqFollow
Abdul Monem S. Rahma, Department of Computer Science, University of Technology, Baghdad, IraqFollow

Document Type

Article

Abstract

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.

Keywords

Odd Magic Square, Cryptography, linear equation system, finite field, GF(28).

Recommended Citation

Alatta, Ibrahim Malik and Rahma, Abdul Monem S. (2021) "A Comparison Between Odd Magic Squares Use In Cryptographic Algorithms," Al-Qadisiyah Journal of Pure Science: Vol. 26 : No. 4 , Article 53.
Available at: https://doi.org/10.29350/qjps.2021.26.4.1399