Semigroup of Matrices over GF{2^s} and Its Relation to AES
Otokar Grošek ; Július Šiška
Computing and Informatics, Tome 28 (2012) no. 1, / Harvested from Computing and Informatics
Text on Computing and Informatics
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).
Publié le : 2012-01-26
Classification:  AES; MixColumn operation; Euler-Fermat theorem 
@article{cai462,
     author = {Otokar Gro\v sek and J\'ulius \v Si\v ska},
     title = {Semigroup of Matrices over GF{2^s} and Its Relation to AES},
     journal = {Computing and Informatics},
     volume = {28},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai462}
}

Otokar Grošek; Július Šiška. Semigroup of Matrices over GF{2^s} and Its Relation to AES. Computing and Informatics, Tome 28 (2012) no. 1, . http://gdmltest.u-ga.fr/item/cai462/