Semigroup of Matrices over GF{2^s} and Its Relation to AES
Keywords:
AES, MixColumn operation, Euler-Fermat theoremAbstract
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).Downloads
Download data is not yet available.
Downloads
Published
2012-02-20
How to Cite
Grošek, O., & Šiška, J. (2012). Semigroup of Matrices over GF{2^s} and Its Relation to AES. Computing and Informatics, 22(5), 417–426. Retrieved from http://147.213.75.17/ojs/index.php/cai/article/view/462
Issue
Section
Articles