Efficient Multiplication in F3kn, m>=1 and 5<=l<=18. - Murat Cenk; Ferruh Özbudak (AFRICACRYPT, 2008)

Polynomial Multiplication over Finite Fields Using Field Extensions and Interpolation. - Murat Cenk; Çetin Kaya Koç; Ferruh Özbudak (IEEE Symposium on Computer Arithmetic, 2009)

Improved Polynomial Multiplication Formulas over $IF2$ Using Chinese Remainder Theorem. - Murat Cenk; Ferruh Özbudak (IEEE Trans. Computers, 2009)

Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity. - Sedat Akleylek; Murat Cenk; Ferruh Özbudak (INDOCRYPT, 2010)

Faster Montgomery Modular Multiplication without Pre-computational Phase For Some Classes of Finite Fields. - Sedat Akleylek; Murat Cenk; Ferruh Özbudak (ISCIS, 2010)

On multiplication in finite fields. - Murat Cenk; Ferruh Özbudak (J. Complex., 2010)

Improved Three-Way Split Formulas for Binary Polynomial Multiplication. - Murat Cenk; Christophe Nègre; M. Anwar Hasan (Selected Areas in Cryptography, 2011)

Efficient multiplications in F55n and F77n. - Murat Cenk; Ferruh Özbudak (J. Comput. Appl. Math., 2011)

Multiplication of polynomials modulo xn. - Murat Cenk; Ferruh Özbudak (Theor. Comput. Sci., 2011)

On the Polynomial Multiplication in Chebyshev Form. - Sedat Akleylek; Murat Cenk; Ferruh Özbudak (IEEE Trans. Computers, 2012)

On the Arithmetic Complexity of Strassen-Like Matrix Multiplications. - Murat Cenk; M. Anwar Hasan (IACR Cryptol. ePrint Arch., 2013)

A New Representation of Elements of Binary Fields with Subquadratic Space Complexity Multiplication of Polynomials. - Ferruh Özbudak; Sedat Akleylek; Murat Cenk (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013)

On the generalisation of special moduli for faster interleaved montgomery modular multiplication. - Sedat Akleylek; Murat Cenk; Ferruh Özbudak (IET Inf. Secur., 2013)

Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products. - Murat Cenk; Christophe Nègre; M. Anwar Hasan (IEEE Trans. Computers, 2013)

Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination. - Murat Cenk; M. Anwar Hasan; Christophe Nègre (IEEE Trans. Computers, 2014)

Some new results on binary polynomial multiplication. - Murat Cenk; M. Anwar Hasan (J. Cryptogr. Eng., 2015)

A New Algorithm for Residue Multiplication Modulo 2^521-1. - Shoukat Ali; Murat Cenk (ICISC, 2016)

Estonian Voting Verification Mechanism Revisited. - Koksal Mus; Mehmet Sabir Kiraz; Murat Cenk; Isa Sertkaya (CoRR, 2016)

A new algorithm for residue multiplication modulo 2521-1. - Shoukat Ali; Murat Cenk (IACR Cryptol. ePrint Arch., 2016)

Speeding up Curve25519 using Toeplitz Matrix-vector Multiplication. - Halil Kemal Taskin; Murat Cenk (CS2@HiPEAC, 2018)

An Improved Algorithm for Iterative Matrix-Vector Multiplications over Finite Fields. - Ceyda Mangir; Murat Cenk; Murat Manguoglu (SecITC, 2018)

Karatsuba-like formulae and their associated techniques. - Murat Cenk (J. Cryptogr. Eng., 2018)

Faster Residue Multiplication Modulo 521-bit Mersenne Prime and an Application to ECC. - Shoukat Ali; Murat Cenk (IEEE Trans. Circuits Syst. I Regul. Pap., 2018)

New Efficient Algorithms for Multiplication Over Fields of Characteristic Three. - Murat Cenk; Farhad Haghighi Zadeh; M. Anwar Hasan (J. Signal Process. Syst., 2018)

Compact and Simple RLWE Based Key Encapsulation Mechanism. - Erdem Alkim; Yusuf Alper Bilgin; Murat Cenk (LATINCRYPT, 2019)

A Parallel GPU Implementation of SWIFFTX. - Metin Evrim Ulu; Murat Cenk (MACIS, 2019)

TMVP-based Multiplication for Polynomial Quotient Rings and Application to Saber on ARM Cortex-M4. - Irem Keskinkurt Paksoy; Murat Cenk (IACR Cryptol. ePrint Arch., 2020)

Cortex-M4 optimizations for {R, M} LWE schemes. - Erdem Alkim; Yusuf Alper Bilgin; Murat Cenk; François Gérard (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2020)

Improved Polynomial Multiplication Algorithms over Characteristic Three Fields and Applications to NTRU Prime. - Esra Yeniaras; Murat Cenk (SecITC, 2021)

An Improved Range Proof with Base-3 Construction. - Esra Günsay; Cansu Betin Onur; Murat Cenk (IACR Cryptol. ePrint Arch., 2021)

A Supersingular Isogeny-Based Ring Signature. - Maryam Sheikhi Garjan; N. Gamze Orhon Kiliç; Murat Cenk (IACR Cryptol. ePrint Arch., 2021)

PLGAKD: A PUF-Based Lightweight Group Authentication and Key Distribution Protocol. - Hüsnü Yildiz; Murat Cenk; Ertan Onur (IEEE Internet Things J., 2021)

Faster characteristic three polynomial multiplication and its application to NTRU Prime decapsulation. - Esra Yeniaras; Murat Cenk (J. Cryptogr. Eng., 2022)

Faster NTRU on ARM Cortex-M4 With TMVP-Based Multiplication. - Irem Keskinkurt Paksoy; Murat Cenk (IEEE Trans. Circuits Syst. I Regul. Pap., 2022)

Efficient Batch Post-quantum Signatures with Crystals Dilithium. - Nazli Deniz Türe; Murat Cenk (WAIFI, 2024)

Efficient Batch Algorithms for the Post-Quantum Crystals Dilithium Signature Scheme and Crystals Kyber Encryption Scheme. - Nazli Deniz Türe; Murat Cenk (IACR Cryptol. ePrint Arch., 2024)

A fast NTRU software implementation based on 5-way TMVP. - Neslihan Yaman Gökce; Anil Burak Gökce; Murat Cenk (J. Inf. Secur. Appl., 2024)

A different base approach for better efficiency on range proofs. - Esra Günsay; Cansu Betin Onur; Murat Cenk (J. Inf. Secur. Appl., 2024)

Accelerating EdDSA Signature Verification with Faster Scalar Size Halving. - Muhammad ElSheikh; Irem Keskinkurt Paksoy; Murat Cenk; M. Anwar Hasan (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2025)