Authors
1 Department of Computer Science, University of Technology, Baghdad, Iraq.
2 Computer Sciences Dep. University of Technology Baghdad, Iraq
Abstract
This paper aims to develop a new cryptographic algorithm that is
based on the magic square method of order five with multi message lengths to
be more complex in order to increase the complexity; in addition to comparing
the cipher with the use of the magic square of order five, four and three (all
single message length. The proposed work has been done by using two extra
rounds and depending on round statuse ( even or odd) , messages are detected
to be used. The key is placed in agreed positions, then the remaining positions
are filled with the message, and then certain sums are calculated to represent
the encrypted text. Speed, complexity, histogram calculations for images, and
NIST calculations for texts were calculated, and the results were compared,
where the complexity of the algorithms was as follows ((P)15 × (256)10)2 × (P)11
× (256)14 and ((256)15 × (256)10)2 × (256)11 × (256)14 for GF(P) and GF(28)
respectively , From that, it has been discovered that the proposed algorithm
(Magic Square of order five with multi message length) is better than the rest of
the algorithms as it has excellent complexity and a slight difference in the
speed.
Keywords
)