default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMeltem Kurt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Meltem Kurt Pehlivanoglu, Mehmet Ali Demir:
Optimizing implementations of linear layers using two and higher input XOR gates. PeerJ Comput. Sci. 10: e1820 (2024)- 2023
- [j4]Meltem Kurt PehlIvanoõlu
, Fatma Büyüksaraçoglu Sakalli, Sedat Akleylek, Muharrem Tolga Sakalli:
On the Construction of New Lightweight Involutory MDS Matrices in Generalized Subfield Form. IEEE Access 11: 32708-32715 (2023) - [j3]Gökhan Tuncay, Fatma Büyüksaraçoglu Sakalli, Meltem Kurt Pehlivanoglu, Gülsüm Gözde Yilmazgüç, Sedat Akleylek, Muharrem Tolga Sakalli:
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) - [c8]Owen Millwood, Meltem Kurt Pehlivanoglu, Aryan Mohammadi Pasikhani, Jack Miskelly, Prosanta Gope, Elif Bilge Kavun:
A Generic Obfuscation Framework for Preventing ML-Attacks on Strong-PUFs through Exploitation of DRAM-PUFs. EuroS&P 2023: 92-106 - [c7]Owen Millwood, Hongming Fei, Prosanta Gope, Oguz Narli, Meltem Kurt Pehlivanoglu, Elif Bilge Kavun, Biplab Sikdar:
A Privacy-Preserving Protocol Level Approach to Prevent Machine Learning Modelling Attacks on PUFs in the Presence of Semi-Honest Verifiers. HOST 2023: 326-336 - 2021
- [c6]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 - [c5]Meltem Kurt PehlIvanoõlu, Fatma Büyüksaraçoõlu Sakalli, Sedat Akleylek, Muharrem Tolga Sakalli:
Binary Finite Field Extensions for Diffusion Matrices over the Finite Field F2m. SIU 2021: 1-4
2010 – 2019
- 2019
- [c4]Sinan Çalisir, Meltem Kurt PehlIvanoõlu:
Model-Free Reinforcement Learning Algorithms: A Survey. SIU 2019: 1-4 - 2018
- [b1]Meltem Kurt Pehlivanoglu:
Maksimum uzaklıkta ayrılabilen matrislerin elde edilebilmesi için yeni bir matris formu ve bir hafif sıklet blok şifreye uygulaması (A new matrix form to obtain maximum distance separable matrices and its implementation in a lightweight block cipher). Kocaeli University, Turkey, 2018 - [j2]Meltem Kurt PehlIvanoõlu, Muharrem Tolga Sakalli, Sedat Akleylek, Nevcihan Duru, Vincent Rijmen:
Generalisation of Hadamard matrix to generate involutory MDS matrices for lightweight cryptography. IET Inf. Secur. 12(4): 348-355 (2018) - 2016
- [c3]Meltem Kurt PehlIvanoõlu, Nevcihan Duru:
Encryption of Walsh Hadamard Transform applied images with the AES encryption algorithm. SIU 2016: 301-304 - 2015
- [j1]Burcu Kir Savas, Meltem Kurt, Oguzhan Urhan:
Local Binary Pattern Based Fast Digital Image Stabilization. IEEE Signal Process. Lett. 22(3): 341-345 (2015) - [c2]Meltem Kurt PehlIvanoõlu, Burcu Kir Savas, Nevcihan Duru:
LSB based steganography over video files using Koblitz's Method. SIU 2015: 1034-1037 - 2014
- [c1]Meltem Kurt, Nevcihan Duru:
Steganography over video files using Menezes Vanstone Elliptic Curve Cryptography Algorithm. SIU 2014: 1195-1198
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-08-27 22:58 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:
