Murat Cenk

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 25

Top Topics

Gpu Implementation

Matrix Multiplication

Top Venues

IACR Cryptol. ePrint Arch.

J. Cryptogr. Eng.

IEEE Trans. Circuits Syst. I Regul. Pap.

Publications

Neslihan Yaman Gökce, Anil Burak Gökce, Murat Cenk
A fast NTRU software implementation based on 5-way TMVP. J. Inf. Secur. Appl. 81 (2024)
Esra Günsay, Cansu Betin Onur, Murat Cenk
A Different Base Approach for Better Efficiency on Range Proofs. IACR Cryptol. ePrint Arch. 2023 (2023)
Irem Keskinkurt Paksoy, Murat Cenk
Faster NTRU on ARM Cortex-M4 With TMVP-Based Multiplication. IEEE Trans. Circuits Syst. I Regul. Pap. 69 (10) (2022)
Irem Keskinkurt Paksoy, Murat Cenk
Faster NTRU on ARM Cortex-M4 with TMVP-based multiplication. IACR Cryptol. ePrint Arch. 2022 (2022)
Esra Yeniaras, Murat Cenk
Faster characteristic three polynomial multiplication and its application to NTRU Prime decapsulation. J. Cryptogr. Eng. 12 (3) (2022)
Maryam Sheikhi-Garjan, N. Gamze Orhon Kiliç, Murat Cenk
A Supersingular Isogeny-Based Ring Signature. IACR Cryptol. ePrint Arch. 2021 (2021)
Esra Günsay, Cansu Betin Onur, Murat Cenk
An Improved Range Proof with Base-3 Construction. SIN (2021)
Hüsnü Yildiz, Murat Cenk, Ertan Onur
PLGAKD: A PUF-Based Lightweight Group Authentication and Key Distribution Protocol. IEEE Internet Things J. 8 (7) (2021)
Esra Günsay, Cansu Betin Onur, Murat Cenk
An Improved Range Proof with Base-3 Construction. IACR Cryptol. ePrint Arch. 2021 (2021)
Esra Yeniaras, Murat Cenk
Improved Polynomial Multiplication Algorithms over Characteristic Three Fields and Applications to NTRU Prime. SecITC (2021)
Esra Yeniaras, Murat Cenk
Faster Characteristic Three Polynomial Multiplication and Its Application to NTRU Prime Decapsulation. IACR Cryptol. ePrint Arch. 2020 (2020)
Irem Keskinkurt Paksoy, Murat Cenk
TMVP-based Multiplication for Polynomial Quotient Rings and Application to Saber on ARM Cortex-M4. IACR Cryptol. ePrint Arch. 2020 (2020)
Erdem Alkim, Yusuf Alper Bilgin, Murat Cenk, François Gérard
Cortex-M4 optimizations for {R, M} LWE schemes. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2020 (3) (2020)
Erdem Alkim, Yusuf Alper Bilgin, Murat Cenk, François Gérard
Cortex-M4 Optimizations for \{R, M\}LWE Schemes. IACR Cryptol. ePrint Arch. 2020 (2020)
Metin Evrim Ulu, Murat Cenk
A Parallel GPU Implementation of SWIFFTX. MACIS (2019)
Erdem Alkim, Yusuf Alper Bilgin, Murat Cenk
Compact and Simple RLWE Based Key Encapsulation Mechanism. LATINCRYPT (2019)
Ceyda Mangir, Murat Cenk, Murat Manguoglu
An Improved Algorithm for Iterative Matrix-Vector Multiplications over Finite Fields. SecITC (2018)
Murat Cenk
Karatsuba-like formulae and their associated techniques. J. Cryptogr. Eng. 8 (3) (2018)
Shoukat Ali, Murat Cenk
Faster Residue Multiplication Modulo 521-bit Mersenne Prime and an Application to ECC. IEEE Trans. Circuits Syst. I Regul. Pap. (8) (2018)
Murat Cenk, Farhad Haghighi Zadeh, M. Anwar Hasan
New Efficient Algorithms for Multiplication Over Fields of Characteristic Three. J. Signal Process. Syst. 90 (3) (2018)
Halil Kemal Taskin, Murat Cenk
Speeding up Curve25519 using Toeplitz Matrix-vector Multiplication. CS2@HiPEAC (2018)
Murat Cenk, M. Anwar Hasan
On the arithmetic complexity of Strassen-like matrix multiplications. J. Symb. Comput. 80 (2017)
Shoukat Ali, Murat Cenk
A New Algorithm for Residue Multiplication Modulo 2^521-1. ICISC (2016)
Koksal Mus, Mehmet Sabir Kiraz, Murat Cenk, Isa Sertkaya
Estonian Voting Verification Mechanism Revisited. CoRR (2016)
Shoukat Ali, Murat Cenk
-1. IACR Cryptol. ePrint Arch. 2016 (2016)
Murat Cenk, M. Anwar Hasan
Some New Results on Binary Polynomial Multiplication. IACR Cryptol. ePrint Arch. 2015 (2015)
Murat Cenk, M. Anwar Hasan
Some new results on binary polynomial multiplication. J. Cryptogr. Eng. 5 (4) (2015)
Murat Cenk, M. Anwar Hasan, Christophe Nègre
Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination. IEEE Trans. Computers 63 (9) (2014)
Murat Cenk, Christophe Nègre, M. Anwar Hasan
Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products. IEEE Trans. Computers 62 (7) (2013)
Ferruh Özbudak, Sedat Akleylek, Murat Cenk
A New Representation of Elements of Binary Fields with Subquadratic Space Complexity Multiplication of Polynomials. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (10) (2013)
Sedat Akleylek, Murat Cenk, Ferruh Özbudak
On the generalisation of special moduli for faster interleaved montgomery modular multiplication. IET Inf. Secur. 7 (3) (2013)
Murat Cenk, M. Anwar Hasan
On the Arithmetic Complexity of Strassen-Like Matrix Multiplications. IACR Cryptol. ePrint Arch. 2013 (2013)
Sedat Akleylek, Murat Cenk, Ferruh Özbudak
On the Polynomial Multiplication in Chebyshev Form. IEEE Trans. Computers 61 (4) (2012)
Murat Cenk, Ferruh Özbudak
. J. Comput. Appl. Math. 236 (2) (2011)
Murat Cenk, Christophe Nègre, M. Anwar Hasan
Improved Three-Way Split Formulas for Binary Polynomial Multiplication. Selected Areas in Cryptography (2011)
Murat Cenk, Ferruh Özbudak
. Theor. Comput. Sci. 412 (29) (2011)
Sedat Akleylek, Murat Cenk, Ferruh Özbudak
Faster Montgomery Modular Multiplication without Pre-computational Phase For Some Classes of Finite Fields. ISCIS (2010)
Murat Cenk, Ferruh Özbudak
On multiplication in finite fields. J. Complex. 26 (2) (2010)
Sedat Akleylek, Murat Cenk, Ferruh Özbudak
Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity. INDOCRYPT (2010)
Murat Cenk, Ferruh Özbudak
$ Using Chinese Remainder Theorem. IEEE Trans. Computers 58 (4) (2009)
Murat Cenk, Çetin Kaya Koç, Ferruh Özbudak
Polynomial Multiplication over Finite Fields Using Field Extensions and Interpolation. IEEE Symposium on Computer Arithmetic (2009)
Murat Cenk, Ferruh Özbudak
, m>=1 and 5<=l<=18. AFRICACRYPT (2008)