On the automorphisms and isomorphisms of MDS matrices and their efficient implementations
dc.authorid | Akleylek, Sedat/0000-0001-7005-6489 | |
dc.authorid | akkanat, kemal/0000-0002-6448-7378 | |
dc.authorid | Rijmen, Vincent/0000-0001-7401-2088 | |
dc.authorwosid | Akleylek, Sedat/N-2620-2019 | |
dc.contributor.author | Sakalli, Muharrem Tolga | |
dc.contributor.author | Akleylek, Sedat | |
dc.contributor.author | Akkanat, Kemal | |
dc.contributor.author | Rijmen, Vincent | |
dc.date.accessioned | 2024-06-12T11:08:09Z | |
dc.date.available | 2024-06-12T11:08:09Z | |
dc.date.issued | 2020 | |
dc.department | Trakya Üniversitesi | en_US |
dc.description.abstract | In this paper, we explicitly define the automorphisms of MDS matrices over the same binary extension field. By extending this idea, we present the isomorphisms between MDS matrices over F-2m and MDS matrices over F-2mt, where t >= 1 and m > 1, which preserves the software implementation properties in view of XOR operations and table lookups of any given MDS matrix over F-2m. Then we propose a novel method to obtain distinct functions related to these automorphisms and isomorphisms to be used in generating isomorphic MDS matrices (new MDS matrices in view of implementation properties) using the existing ones. The comparison with the MDS matrices used in AES, ANUBIS, and subfield-Hadamard construction shows that we generate an involutory 4 x 4 MDS matrix over F-28 (from an involutory 4 x 4 MDS matrix over F-24) whose required number of XOR operations is the same as that of ANUBIS and the subfield-Hadamard construction, and better than that of AES. The proposed method, due to its ground field structure, is intended to be a complementary method for the current construction methods in the literature. | en_US |
dc.description.sponsorship | TUBITAK [EEEAG-116E279] | en_US |
dc.description.sponsorship | The authors would like to express their gratitude to the anonymous reviewers for their invaluable suggestions in putting the present study into its final form. Sedat Akleylek was partially supported by TUBITAK under Grant No. EEEAG-116E279. | en_US |
dc.identifier.doi | 10.3906/elk-1906-151 | |
dc.identifier.endpage | 287 | en_US |
dc.identifier.issn | 1300-0632 | |
dc.identifier.issn | 1303-6203 | |
dc.identifier.issue | 1 | en_US |
dc.identifier.scopus | 2-s2.0-85079855236 | en_US |
dc.identifier.scopusquality | Q3 | en_US |
dc.identifier.startpage | 275 | en_US |
dc.identifier.trdizinid | 334610 | en_US |
dc.identifier.uri | https://doi.org/10.3906/elk-1906-151 | |
dc.identifier.uri | https://search.trdizin.gov.tr/yayin/detay/334610 | |
dc.identifier.uri | https://hdl.handle.net/20.500.14551/22320 | |
dc.identifier.volume | 28 | en_US |
dc.identifier.wos | WOS:000510459900020 | en_US |
dc.identifier.wosquality | Q4 | en_US |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.indekslendigikaynak | TR-Dizin | en_US |
dc.language.iso | en | en_US |
dc.publisher | Tubitak Scientific & Technological Research Council Turkey | en_US |
dc.relation.ispartof | Turkish Journal Of Electrical Engineering And Computer Sciences | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | MDS Matrix | en_US |
dc.subject | Branch Number | en_US |
dc.subject | Block Cipher | en_US |
dc.subject | Generate | en_US |
dc.title | On the automorphisms and isomorphisms of MDS matrices and their efficient implementations | en_US |
dc.type | Article | en_US |