Murat Cenk

E-mail

mcenk@metu.edu.tr

Department

Graduate School of Applied Mathematics

ORCID

0000-0003-4941-8734

Scopus Author ID

6504402955

Web of Science Researcher ID

ABA-2432-2020

Efficient Batch Post-quantum Signatures with Crystals Dilithium Türe, Nazlı Deniz; Cenk, Murat (2025-01-01) Digital signatures ensure authenticity and secure communication. They are used to verify the integrity and authenticity of signed documents and are widely utilized in various fields such as information technologies, financ...
A different base approach for better efficiency on range proofs Günsay, Esra; Betin Onur, Cansu; Cenk, Murat (2024-09-01) Zero-knowledge range proofs (ZKRPs) are commonly used to prove the validation of a secret integer lies in an interval to some other party in a secret way. In many ZKRPs, the secret is represented in binary and then committ...
A fast NTRU software implementation based on 5-way TMVP Yaman Gökce, Neslihan; Gökce, Anıl Burak; Cenk, Murat (2024-03-01) The fast and efficient operation of post-quantum cryptographic algorithms has become an important research topic, especially with the recent developments and the process of the PQC Standardization Project by NIST. Various ...
Faster NTRU on ARM Cortex-M4 With TMVP-Based Multiplication Keskinkurt Paksoy, İrem; Cenk, Murat (2022-07-01) This paper focuses on speeding up NTRU -one of the lattice-based finalists of the NIST PQC competition -by improving the ring multiplication. The Number Theoretic Transform (NTT), Toom-Cook, and Karatsuba are the most comm...
Analysis of Block Recombination and Lazy Interpolation Methods and Their Applications to Saber Aksoy, Berkin; Cenk, Murat (2022-01-01) Since the beginning of the National Institute of Standards and Technology (NIST), The Post-Quantum Cryptog-raphy (PQC) Standardization Process, efficient implementations of lattice-based algorithms have been studied extens...
Improved Polynomial Multiplication Algorithms over Characteristic Three Fields and Applications to NTRU Prime Yeniaras, Esra; Cenk, Murat (2022-01-01) This paper introduces a new polynomial multiplication algorithm which decreases the arithmetic complexity and another modified algorithm that speeds up the implementation run-time over the characteristic three fields. We f...
Kuantum Öncesinden Kuantum Sonrasına Eliptik Eğri Kriptografi ve Uygulamaları Cenk, Murat; Yılmaz, Burcu Ecem; Orhon Kılıç, Neriman Gamze (Nobel Akademik Yayıncılık Eğitim Danışmanlık Tic. Ltd. Şti, 2022-01-01)
Faster characteristic three polynomial multiplication and its application to NTRU Prime decapsulation Yeniaras, Esra; Cenk, Murat (2022-01-01) Efficient computation of polynomial multiplication over characteristic three fields is required for post-quantum cryptographic applications which gain importance upon the recent advances in quantum computers. In this paper...
An Improved Range Proof with Base-3 Construction Günsay, Esra; Onur, Cansu Betin; Cenk, Murat (2021-01-01) Zero-knowledge protocols (ZKPs) allow a party to prove the validation of secret information to some other party without revealing any information about the secret itself. Appropriate, effective, and efficient use of crypto...
TMVP-Friendly Primes for Efficient Elliptic Curve Cryptography Taskin, Halil Kemal; Cenk, Murat (2020-12-03) The need for faster and practical cryptography is a research topic for decades. In case of elliptic curve cryptography, which was proposed by Koblitz and Miller in 1985 as a more efficient alternative to RSA, the applicati...

Citation Formats