Murat Cenk

49 papers B 1C 3Misc 2Journal 35Unranked 7
YearRankTypeTitle / Venue / Authors
2026 J jnl
Secure Montgomery Curves over TMVP-Friendly Primes for High-Performance ECC.
IACR Cryptol. ePrint Arch.
Murat Cenk, N. Gamze Orhon Kiliç, Halil Kemal Taskin, Oguz Yayla
2025 J jnl
Accelerating EdDSA Signature Verification with Faster Scalar Size Halving.
IACR Trans. Cryptogr. Hardw. Embed. Syst.
Muhammad ElSheikh, Irem Keskinkurt Paksoy, Murat Cenk, M. Anwar Hasan
2025 J jnl
Quantum Disruption: An SOK of How Post-Quantum Attackers Reshape Blockchain Security and Performance.
CoRR
Tushin Mallick, Maya Zeldin, Murat Cenk, Cristina Nita-Rotaru
2024 J jnl
A different base approach for better efficiency on range proofs.
J. Inf. Secur. Appl.
Esra Günsay, Cansu Betin Onur, Murat Cenk
2024 J jnl
A fast NTRU software implementation based on 5-way TMVP.
J. Inf. Secur. Appl.
Neslihan Yaman Gökce, Anil Burak Gökce, Murat Cenk
2024 J jnl
Efficient Batch Algorithms for the Post-Quantum Crystals Dilithium Signature Scheme and Crystals Kyber Encryption Scheme.
IACR Cryptol. ePrint Arch.
Nazli Deniz Türe, Murat Cenk
2024 C conf
Efficient Batch Post-quantum Signatures with Crystals Dilithium.
WAIFI
Nazli Deniz Türe, Murat Cenk
2023 J jnl
A Different Base Approach for Better Efficiency on Range Proofs.
IACR Cryptol. ePrint Arch.
Esra Günsay, Cansu Betin Onur, Murat Cenk
2022 J jnl
Faster NTRU on ARM Cortex-M4 With TMVP-Based Multiplication.
IEEE Trans. Circuits Syst. I Regul. Pap.
Irem Keskinkurt Paksoy, Murat Cenk
2022 J jnl
Faster NTRU on ARM Cortex-M4 with TMVP-based multiplication.
IACR Cryptol. ePrint Arch.
Irem Keskinkurt Paksoy, Murat Cenk
2022 J jnl
Faster characteristic three polynomial multiplication and its application to NTRU Prime decapsulation.
J. Cryptogr. Eng.
Esra Yeniaras, Murat Cenk
2021 J jnl
A Supersingular Isogeny-Based Ring Signature.
IACR Cryptol. ePrint Arch.
Maryam Sheikhi Garjan, N. Gamze Orhon Kiliç, Murat Cenk
2021 C conf
An Improved Range Proof with Base-3 Construction.
SIN
Esra Günsay, Cansu Betin Onur, Murat Cenk
2021 J jnl
An Improved Range Proof with Base-3 Construction.
IACR Cryptol. ePrint Arch.
Esra Günsay, Cansu Betin Onur, Murat Cenk
2021 — conf
Improved Polynomial Multiplication Algorithms over Characteristic Three Fields and Applications to NTRU Prime.
SecITC
Esra Yeniaras, Murat Cenk
2021 J jnl
PLGAKD: A PUF-Based Lightweight Group Authentication and Key Distribution Protocol.
IEEE Internet Things J.
Hüsnü Yildiz, Murat Cenk, Ertan Onur
2020 J jnl
Cortex-M4 Optimizations for \{R, M\}LWE Schemes.
IACR Cryptol. ePrint Arch.
Erdem Alkim, Yusuf Alper Bilgin, Murat Cenk, François Gérard
2020 J jnl
Cortex-M4 optimizations for {R, M} LWE schemes.
IACR Trans. Cryptogr. Hardw. Embed. Syst.
Erdem Alkim, Yusuf Alper Bilgin, Murat Cenk, François Gérard
2020 J jnl
Faster Characteristic Three Polynomial Multiplication and Its Application to NTRU Prime Decapsulation.
IACR Cryptol. ePrint Arch.
Esra Yeniaras, Murat Cenk
2020 J jnl
TMVP-based Multiplication for Polynomial Quotient Rings and Application to Saber on ARM Cortex-M4.
IACR Cryptol. ePrint Arch.
Irem Keskinkurt Paksoy, Murat Cenk
2019 — conf
A Parallel GPU Implementation of SWIFFTX.
MACIS
Metin Evrim Ulu, Murat Cenk
2019 — conf
Compact and Simple RLWE Based Key Encapsulation Mechanism.
LATINCRYPT
Erdem Alkim, Yusuf Alper Bilgin, Murat Cenk
2018 — conf
An Improved Algorithm for Iterative Matrix-Vector Multiplications over Finite Fields.
SecITC
Ceyda Mangir, Murat Cenk, Murat Manguoglu
2018 J jnl
Faster Residue Multiplication Modulo 521-bit Mersenne Prime and an Application to ECC.
IEEE Trans. Circuits Syst. I Regul. Pap.
Shoukat Ali, Murat Cenk
2018 J jnl
Karatsuba-like formulae and their associated techniques.
J. Cryptogr. Eng.
Murat Cenk
2018 J jnl
New Efficient Algorithms for Multiplication Over Fields of Characteristic Three.
J. Signal Process. Syst.
Murat Cenk, Farhad Haghighi Zadeh, M. Anwar Hasan
2018 — conf
Speeding up Curve25519 using Toeplitz Matrix-vector Multiplication.
CS2@HiPEAC
Halil Kemal Taskin, Murat Cenk
2017 J jnl
On the arithmetic complexity of Strassen-like matrix multiplications.
J. Symb. Comput.
Murat Cenk, M. Anwar Hasan
2016 Misc conf
A New Algorithm for Residue Multiplication Modulo 2^521-1.
ICISC
Shoukat Ali, Murat Cenk
2016 J jnl
A new algorithm for residue multiplication modulo 2
IACR Cryptol. ePrint Arch.
Shoukat Ali, Murat Cenk
2016 J jnl
Estonian Voting Verification Mechanism Revisited.
CoRR
Koksal Mus, Mehmet Sabir Kiraz, Murat Cenk, Isa Sertkaya
2015 J jnl
Some New Results on Binary Polynomial Multiplication.
IACR Cryptol. ePrint Arch.
Murat Cenk, M. Anwar Hasan
2015 J jnl
Some new results on binary polynomial multiplication.
J. Cryptogr. Eng.
Murat Cenk, M. Anwar Hasan
2014 J jnl
Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination.
IEEE Trans. Computers
Murat Cenk, M. Anwar Hasan, Christophe Nègre
2013 J jnl
A New Representation of Elements of Binary Fields with Subquadratic Space Complexity Multiplication of Polynomials.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Ferruh Özbudak, Sedat Akleylek, Murat Cenk
2013 J jnl
Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products.
IEEE Trans. Computers
Murat Cenk, Christophe Nègre, M. Anwar Hasan
2013 J jnl
On the Arithmetic Complexity of Strassen-Like Matrix Multiplications.
IACR Cryptol. ePrint Arch.
Murat Cenk, M. Anwar Hasan
2013 J jnl
On the generalisation of special moduli for faster interleaved montgomery modular multiplication.
IET Inf. Secur.
Sedat Akleylek, Murat Cenk, Ferruh Özbudak
2012 J jnl
On the Polynomial Multiplication in Chebyshev Form.
IEEE Trans. Computers
Sedat Akleylek, Murat Cenk, Ferruh Özbudak
2011 J jnl
Efficient multiplications in F
J. Comput. Appl. Math.
Murat Cenk, Ferruh Özbudak
2011 B conf
Improved Three-Way Split Formulas for Binary Polynomial Multiplication.
Selected Areas in Cryptography
Murat Cenk, Christophe Nègre, M. Anwar Hasan
2011 J jnl
Multiplication of polynomials modulo x
Theor. Comput. Sci.
Murat Cenk, Ferruh Özbudak
2010 — conf
Faster Montgomery Modular Multiplication without Pre-computational Phase For Some Classes of Finite Fields.
ISCIS
Sedat Akleylek, Murat Cenk, Ferruh Özbudak
2010 J jnl
On multiplication in finite fields.
J. Complex.
Murat Cenk, Ferruh Özbudak
2010 Misc conf
Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity.
INDOCRYPT
Sedat Akleylek, Murat Cenk, Ferruh Özbudak
2009 J jnl
Improved Polynomial Multiplication Formulas over $IF
IEEE Trans. Computers
Murat Cenk, Ferruh Özbudak
2009 C conf
Polynomial Multiplication over Finite Fields Using Field Extensions and Interpolation.
IEEE Symposium on Computer Arithmetic
Murat Cenk, Çetin Kaya Koç, Ferruh Özbudak
2009 — —
Results on complexity of multiplication over finite fields ; Sonlu cisimlerde çarpma karmaşıklığı üzerine sonuçlar.
Murat Cenk
2008 — conf
Efficient Multiplication in F
AFRICACRYPT
Murat Cenk, Ferruh Özbudak