On the Construction of 20 x 20 and 24 x 24 Binary Matrices with Good Implementation Properties for Lightweight Block Ciphers and Hash Functions
dc.authorid | Akleylek, Sedat/0000-0001-7005-6489 | |
dc.authorid | BULUS, Ercan/0000-0001-9442-6253 | |
dc.authorwosid | Akleylek, Sedat/N-2620-2019 | |
dc.authorwosid | BULUS, Ercan/AAR-2066-2020 | |
dc.contributor.author | Sakalli, Muharrem Tolga | |
dc.contributor.author | Akleylek, Sedat | |
dc.contributor.author | Aslan, Bora | |
dc.contributor.author | Bulus, Ercan | |
dc.contributor.author | Sakalli, Fatma Buyuksaracoglu | |
dc.date.accessioned | 2024-06-12T11:17:31Z | |
dc.date.available | 2024-06-12T11:17:31Z | |
dc.date.issued | 2014 | |
dc.department | Trakya Üniversitesi | en_US |
dc.description.abstract | We present an algebraic construction based on state transform matrix (companion matrix) for n x n (where n + 2(k), k being a positive integer) binary matrices with high branch number and low number of fixed points. We also provide examples for 20 x 20 and 24 x 24 binary matrices having advantages on implementation issues in lightweight block ciphers and hash functions. The powers of the companion matrix for an irreducible polynomial over GF(2) with degree 5 and 4 are used in finite field Hadamard or circulant manner to construct 20 x 20 and 24 x 24 binary matrices, respectively. Moreover, the binary matrices are constructed to have good software and hardware implementation properties. To the best of our knowledge, this is the first study for n x n (where n not equal 2(k), k being a positive integer) binary matrices with high branch number and low number of fixed points. | en_US |
dc.description.sponsorship | OMU [PYO.MUH.1904.12.014] | en_US |
dc.description.sponsorship | Sedat Akleylek is partially supported by OMU under the Grant no. PYO.MUH.1904.12.014. The authors thank the anonymous referees for their detailed and very helpful comments and for bringing reference [26] to our attention. The authors also thank Orhun Kara for his valuable comments on the discussion of Remark 7. | en_US |
dc.identifier.doi | 10.1155/2014/540253 | |
dc.identifier.issn | 1024-123X | |
dc.identifier.issn | 1563-5147 | |
dc.identifier.scopus | 2-s2.0-84934918653 | en_US |
dc.identifier.scopusquality | Q2 | en_US |
dc.identifier.uri | https://doi.org/10.1155/2014/540253 | |
dc.identifier.uri | https://hdl.handle.net/20.500.14551/24744 | |
dc.identifier.volume | 2014 | en_US |
dc.identifier.wos | WOS:000345045300001 | en_US |
dc.identifier.wosquality | Q3 | en_US |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.language.iso | en | en_US |
dc.publisher | Hindawi Ltd | en_US |
dc.relation.ispartof | Mathematical Problems In Engineering | 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 | Algebraic Construction | en_US |
dc.title | On the Construction of 20 x 20 and 24 x 24 Binary Matrices with Good Implementation Properties for Lightweight Block Ciphers and Hash Functions | en_US |
dc.type | Article | en_US |