Generating binary diffusion layers with maximum/high branch numbers and low search complexity

Basit Öğe Kaydı
dc.authoridÖztürk, Emir/0000-0002-3734-5171
dc.authoridAkleylek, Sedat/0000-0001-7005-6489
dc.authoridTuncay, Gokhan/0000-0002-4293-4018
dc.authorwosidTuncay, Gökhan/HZJ-8217-2023
dc.authorwosidÖztürk, Emir/Z-1726-2018
dc.authorwosidAkleylek, Sedat/N-2620-2019
dc.contributor.authorAkleylek, Sedat
dc.contributor.authorSakalli, Muharrem Tolga
dc.contributor.authorOzturk, Emir
dc.contributor.authorMesut, Andac Sahin
dc.contributor.authorTuncay, Gokhan
dc.date.accessioned2024-06-12T10:59:37Z
dc.date.available2024-06-12T10:59:37Z
dc.date.issued2016
dc.departmentTrakya Üniversitesien_US
dc.description.abstractIn this paper, we propose a new method to generate n x n binary matrices (for n = k . 2(t) where k and t are positive integers) with a maximum/high of branch numbers and a minimum number of fixed points by using 2(t) x 2(t) Hadamard (almost) maximum distance separable matrices and k x k cyclic binary matrix groups. By using the proposed method, we generate n x n (for n = 6, 8, 12, 16, and 32) binary matrices with a maximum of branch numbers, which are efficient in software implementations. The proposed method is also applicable with m x m circulant matrices to generate n x n (for n = k . m) binary matrices with a maximum/high of branch numbers. For this case, some examples for 16 x 16, 48 x 48, and 64 x 64 binary matrices with branch numbers of 8, 15, and 18, respectively, are presented. Copyright (C) 2016 John Wiley & Sons, Ltd.en_US
dc.description.sponsorshipTUBITAK [2219]en_US
dc.description.sponsorshipSedat Akleylek is partially supported by TUBITAK under 2219-Postdoctoral Research Program Grant. 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.en_US
dc.identifier.doi10.1002/sec.1561
dc.identifier.endpage3569en_US
dc.identifier.issn1939-0114
dc.identifier.issn1939-0122
dc.identifier.issue16en_US
dc.identifier.scopus2-s2.0-84978114982en_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.startpage3558en_US
dc.identifier.urihttps://doi.org/10.1002/sec.1561
dc.identifier.urihttps://hdl.handle.net/20.500.14551/20499
dc.identifier.volume9en_US
dc.identifier.wosWOS:000389250100041en_US
dc.identifier.wosqualityQ4en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherWiley-Hindawien_US
dc.relation.ispartofSecurity And Communication Networksen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectDiffusion Layeren_US
dc.subjectBlock Ciphersen_US
dc.subjectBranch Numberen_US
dc.subjectBinary Matrixen_US
dc.subjectMDS Matrixen_US
dc.subjectAlgebraic Constructionen_US
dc.subjectLinear Transformationsen_US
dc.subjectBlock Cipheren_US
dc.subjectMatrixen_US
dc.titleGenerating binary diffusion layers with maximum/high branch numbers and low search complexityen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu