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<sup>8</sup>). Results were compared with the MS3, they have been found good, with acceptable speed and high complexity where it was (P)<sup>9</sup> × (256)<sup>16</sup> in the first algorithm, (P)<sup>9</sup> × (256)<sup>16</sup> × 3 in the second algorithm, and (P)<sup>9</sup> × (256)<sup>16</sup> × 3 × (P)<sup>25</sup> 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>

Highlights

  • The need for modern society to maintain data security has led researchers, mathematicians, and cryptologists to develop encryption algorithms and make them more complex and difficult to access to ensure the protection of information [1]

  • Jugglers and magicians used them in their incantations; the Islamists in the past were very interested in magic squares too, as it was previously believed that they contained the nine letters that were revealed to Prophet Adam [2]

  • Mathematicians and cryptography scholars are among the first ones interested in magic squares, where many intelligence games have been built based on the idea of magic squares, such as Sudoku [2]

Read more

Summary

Introduction

The need for modern society to maintain data security has led researchers, mathematicians, and cryptologists to develop encryption algorithms and make them more complex and difficult to access to ensure the protection of information [1]. Where the magic square of the third degree was used by assigning some positions to the key and others to the message and multiplying the resulting matrix (from the combination of the key and the message) with a second key matrix equal to the size of the magic square used. As it relied mainly on magic constant [3]. The work was previously developed using the magic square of fifth-degree and different key lengths have been used, namely; 10 and iJIM ‒ Vol 15, No 16, 2021

Results
Discussion
Conclusion
Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.