Murat Cenk

Murat Cenk

Auto-generated profile, based on publicly available information

Murat Cenk

Middle East Technical University

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 October 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
HYHusnu Yildiz
Husnu Yildiz
MCMurat Cenk
Murat Cenk
EOErtan Onur
Ertan Onur
Securing Internet of Things (IoT) applications that collect and transport sensitive data by guaranteeing authenticity, integrity, and confidentiality is a critical challenge. Reducing computation and communication overhead of security functions is also a key concern since a large number of constrained devices may take place in such applications. Our main focus in this paper is group authentication and key management in IoT. The existing group authentication and key management protocols in the literature perform computations using asymmetric ciphers, which costly for IoT. Therefore, applications generally employ simple security primitives that are prone to or lead to cyber-attacks by using IoT devices. In this paper, we propose a physically unclonable function (PUF) based lightweight group authentication and key distribution (PLGAKD) protocol that employs PUF, factorial tree, and the Chinese Remainder Theorem (CRT). In PLGAKD, PUF facilitates lightweight authentication and key distribution for group members. Each group member performs 2 encryptions, 1 decryption, 4 XORs operations, and 3 HMAC operations. For the key renewal process, the factorial tree and CRT help us reduce the number of keys stored in nodes and the number of communication messages contrary to the binary tree. As an example, a binary tree with 4096 members completes the key renewal process with 12 messages by storing 12 keys. However, the PLGAKD protocol with 5040 members completes this process with 6 messages by storing 7 keys. Moreover, the PLGAKD protocol becomes more efficient in parallel with the increase in the number of members.

1 April 2010 in Journal of Complexity
Verified
Journal Article
Closed access
MCMurat Cenk
Murat Cenk
FÖFerruh Özbudak
Ferruh Özbudak

1 May 2017 in Journal of Symbolic Computation
Verified
Journal Article
Closed access
MCMurat Cenk
Murat Cenk
MHM. Anwar Hasan
M. Anwar Hasan

24 April 2012 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
MCMurat Cenk
Murat Cenk
CNChristophe Negre
Christophe Negre
MHM. Anwar Hasan
M. Anwar Hasan
In this paper, we consider three-way split formulas for binary polynomial multiplication and Toeplitz matrix vector product (TMVP). We first recall the best known three-way split formulas for polynomial multiplication: the formulas with six recursive multiplications given by Sunar in a 2006 IEEE Transactions on Computers paper and the formula with five recursive multiplications proposed by Bernstein at CRYPTO 2009. Second, we propose a new set of three-way split formulas for polynomial multiplication that are an optimization of Sunar's formulas. Then, we present formulas with five recursive multiplications based on field extension. In addition, we extend the latter formulas to TMVP. We evaluate the space and delay complexities when computations are performed in parallel and provide a comparison with best known methods.

17 November 2008 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
MCMurat Cenk
Murat Cenk
FÖFerruh Özbudak
Ferruh Özbudak
Let n and lscr be positive integers and f(x) be an irreducible polynomial over IF2 such that lscrdeg(f(x)) < 2n -1. We obtain an effective upper bound for the multiplication complexity of n-term polynomials modulo f(x)lscr. This upper bound allows a better selection of the moduli when Chinese Remainder Theorem is used for polynomial multiplication over IF2. We give improved formulae to multiply polynomials of small degree over IF2. In particular we improve the best known multiplication complexities over IF2 in the literature in some cases.

16 May 2015 in Journal of Cryptographic Engineering
Verified
Journal Article
Closed access
PDF file
MCMurat Cenk
Murat Cenk
MHM. Anwar Hasan
M. Anwar Hasan