Semigroup of Matrices over GF{2^s} and Its Relation to AES

In: Computing and Informatics, vol. 22, no. 5

O. Grošek - J. Šiška

Detaily:

Rok, strany: 2003, 417 - 426

Kľúčové slová:

AES, MixColumn operation, Euler-Fermat theorem

O článku:

We introduce to readers a new matrix C for MixColumn 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 GF(p^s).

Ako citovať:

ISO 690:

Grošek, O., Šiška, J. 2003. Semigroup of Matrices over GF{2^s} and Its Relation to AES. In Computing and Informatics, vol. 22, no.5, pp. 417-426. 1335-9150.

APA:

Grošek, O., Šiška, J. (2003). Semigroup of Matrices over GF{2^s} and Its Relation to AES. Computing and Informatics, 22(5), 417-426. 1335-9150.