Abstract
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.
Keywords
Cite this article
@article{cai-1310,
author = {Otokar Grošek and Július Šiška},
title = {Semigroup of Matrices over GF2s},
journal = {Computing and Informatics},
volume = {22},
number = {5},
pages = {417--426},
year = {2003},
issn = {1335-9150},
url = {https://cai.type.sk/content/2003/5/semigroup-of-matrices-over-gf2s/}
}
TY - JOUR AU - Otokar Grošek AU - Július Šiška TI - Semigroup of Matrices over GF2s JO - Computing and Informatics VL - 22 IS - 5 SP - 417 EP - 426 PY - 2003 SN - 1335-9150 UR - https://cai.type.sk/content/2003/5/semigroup-of-matrices-over-gf2s/ KW - AES KW - MixColumn operation KW - Euler-Fermat theorem ER -
Grošek, O., & Šiška, J. (2003). Semigroup of Matrices over GF2s. Computing and Informatics, 22(5), 417–426. https://cai.type.sk/content/2003/5/semigroup-of-matrices-over-gf2s/