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.