default search action
Muharrem Tolga Sakalli 0001
Person information
- affiliation: Trakya University, Turkey
- not to be confused with: Muharrem Tolga Sakalli 0002
Other persons with the same name
- Muharrem Tolga Sakalli 0002 — Trakya University, Turkey
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j11]Meltem Kurt PehlIvanoõlu
, Fatma Büyüksaraçoglu Sakalli
On the Construction of New Lightweight Involutory MDS Matrices in Generalized Subfield Form. IEEE Access 11: 32708-32715 (2023) - [j10]Gökhan Tuncay
A new hybrid method combining search and direct based construction ideas to generate all 4 × 4 involutory maximum distance separable (MDS) matrices over binary field extensions. PeerJ Comput. Sci. 9: e1577 (2023) - 2021
- [c4]Meltem Kurt PehlIvanoõlu, Fatma Büyüksaraçoglu Sakalli, Sedat Akleylek, Muharrem Tolga Sakalli:
On the Construction of 4 ˟ 4 Lightweight Involutory MDS Matrices Over $\mathbb {F}_{2^{8}}$. ICMC 2021: 725-736 - [c3]Meltem Kurt PehlIvanoõlu
Binary Finite Field Extensions for Diffusion Matrices over the Finite Field F2m. SIU 2021: 1-4 - 2020
- [j9]Muharrem Tolga Sakalli
On the automorphisms and isomorphisms of MDS matrices and their efficient implementations. Turkish J. Electr. Eng. Comput. Sci. 28(1): 275-287 (2020) - [j8]Bora Aslan
Energy Consumption Analysis of Lightweight Cryptographic Algorithms That Can Be Used in the Security of Internet of Things Applications. Secur. Commun. Networks 2020: 8837671:1-8837671:15 (2020)
2010 – 2019
- 2019
- [j7]Gülsüm Gözde Güzel
A new matrix form to generate all 3 × 3 involutory MDS matrices over F2m. Inf. Process. Lett. 147: 61-68 (2019) - 2018
- [j6]Meltem Kurt PehlIvanoõlu
Generalisation of Hadamard matrix to generate involutory MDS matrices for lightweight cryptography. IET Inf. Secur. 12(4): 348-355 (2018) - 2017
- [j5]Sedat Akleylek
Efficient methods to generate cryptographically significant binary diffusion layers. IET Inf. Secur. 11(4): 177-187 (2017) - 2016
- [j4]Sedat Akleylek
Generating binary diffusion layers with maximum/high branch numbers and low search complexity. Secur. Commun. Networks 9(16): 3558-3569 (2016) - 2014
- [j3]Muharrem Tolga Sakalli, Bora Aslan:
On the algebraic construction of cryptographically good 32×32 binary linear transformations. J. Comput. Appl. Math. 259: 485-494 (2014) - [j2]Bora Aslan, Muharrem Tolga Sakalli:
Algebraic construction of cryptographically good binary linear transformations. Secur. Commun. Networks 7(1): 53-63 (2014) - 2013
- [j1]Osman Karaahmetoglu, Muharrem Tolga Sakalli, Ercan Bulus
A new method to determine algebraic expression of power mapping based S-boxes. Inf. Process. Lett. 113(7): 229-235 (2013) - 2010
- [c2]M. Tolga Sakalli, Bora Aslan, Ercan Bulus
On the Algebraic Expression of the AES S-Box Like S-Boxes. NDT (1) 2010: 213-227
2000 – 2009
- 2008
- [c1]Bora Aslan, M. Tolga Sakalli, Ercan Bulus
Classifying 8-Bit to 8-Bit S-Boxes Based on Power Mappings from the Point of DDT and LAT Distributions. WAIFI 2008: 123-133 - 2006
- [b1]Muharrem Tolga Sakalli:
Modern şifreleme yöntemlerinin gücünün incelenmesi (Examining the strenght of modern encryption techniques). Trakya University, Turkey, 2006
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-05 01:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: