Semigroup of Matrices over GF2s
keywords: AES, MixColumn operation, Euler-Fermat theorem
We introduce to readers a new matrix C for textttMixColumn operation for AES algorithm for discussion. This matrix has significantly larger multiplicative order, ord(C) = 340, than the used one which is 4 only. This makes so called XSL attack less effective. It is possible to find such a matrix due to our new Euler-Fermat-like theorem and its corollaries for regular circulant matrices over GFps.
reference: Vol. 22, 2003, No. 5, pp. 417–426