Confidential Transfers for Multi-Purpose Tokens on the XRP Ledger.

Murat Cenk

Murat Cenk Aanchal Malhotra Joseph A. Akinyele Confidential Transfers for Multi-Purpose Tokens on the XRP Ledger. 2026 120548-120576 14 IEEE Access https://doi.org/10.1109/ACCESS.2026.3710381 db/journals/access/access14.html#CenkMA26 streams/journals/access

Murat Cenk N. Gamze Orhon Kiliç Halil Kemal Taskin Oguz Yayla Secure Montgomery Curves over TMVP-Friendly Primes for High-Performance ECC. 2026 165 2026 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2026/165 db/journals/iacr/iacr2026.html#CenkKTY26 streams/journals/iacr

Murat Cenk N. Gamze Orhon Kiliç Halil Kemal Taskin Oguz Yayla Tailored Limb Counts, Faster Arithmetic: Improved TMVP Decompositions for Curve5453 and Curve6071. 588 2026 2026 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2026/588 db/journals/iacr/iacr2026.html#CenkKTY26a

Murat Cenk Aanchal Malhotra Joseph A. Akinyele Confidential Transfers for Multi-Purpose Tokens on the XRP Ledger. 602 2026 2026 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2026/602 db/journals/iacr/iacr2026.html#CenkMA26

Irem Keskinkurt Paksoy Muhammad ElSheikh Murat Cenk M. Anwar Hasan Batch Verification of Modified ECDSA Signatures. 663 2026 2026 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2026/663 db/journals/iacr/iacr2026.html#PaksoyECH26

Muhammad ElSheikh Irem Keskinkurt Paksoy Murat Cenk M. Anwar Hasan Accelerating EdDSA Signature Verification with Faster Scalar Size Halving. 493-515 2025 2025 IACR Trans. Cryptogr. Hardw. Embed. Syst. 3 https://doi.org/10.46586/tches.v2025.i3.493-515 db/journals/tches/tches2025.html#ElSheikhPCH25 streams/journals/tches

Tushin Mallick Maya Zeldin Murat Cenk Cristina Nita-Rotaru Quantum Disruption: An SOK of How Post-Quantum Attackers Reshape Blockchain Security and Performance. 2025 December abs/2512.13333 CoRR https://doi.org/10.48550/arXiv.2512.13333 db/journals/corr/corr2512.html#abs-2512-13333 streams/journals/corr

Neslihan Yaman Gökce Anil Burak Gökce Murat Cenk A fast NTRU software implementation based on 5-way TMVP. 103688 2024 81 J. Inf. Secur. Appl. https://doi.org/10.1016/j.jisa.2023.103688 db/journals/istr/istr81.html#GokceGC24

Esra Günsay Cansu Betin Onur Murat Cenk A different base approach for better efficiency on range proofs. 103860 2024 85 J. Inf. Secur. Appl. https://doi.org/10.1016/j.jisa.2024.103860 db/journals/istr/istr85.html#GunsayOC24 streams/journals/istr

Nazli Deniz Türe Murat Cenk Efficient Batch Post-quantum Signatures with Crystals Dilithium. 237-257 2024 WAIFI https://doi.org/10.1007/978-3-031-81824-0_15 conf/waifi/2024 db/conf/waifi/waifi2024.html#TureC24 streams/conf/waifi

Nazli Deniz Türe Murat Cenk Efficient Batch Algorithms for the Post-Quantum Crystals Dilithium Signature Scheme and Crystals Kyber Encryption Scheme. 1397 2024 2024 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2024/1397 db/journals/iacr/iacr2024.html#TureC24 streams/journals/iacr

Esra Günsay Cansu Betin Onur Murat Cenk A Different Base Approach for Better Efficiency on Range Proofs. 203 2023 2023 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2023/203 db/journals/iacr/iacr2023.html#GunsayOC23

Esra Yeniaras Murat Cenk Faster characteristic three polynomial multiplication and its application to NTRU Prime decapsulation. 329-348 2022 12 J. Cryptogr. Eng. 3 https://doi.org/10.1007/s13389-021-00282-7 https://www.wikidata.org/entity/Q114219852 db/journals/jce/jce12.html#YeniarasC22

Irem Keskinkurt Paksoy Murat Cenk Faster NTRU on ARM Cortex-M4 With TMVP-Based Multiplication. 4083-4092 2022 69 IEEE Trans. Circuits Syst. I Regul. Pap. 10 https://doi.org/10.1109/TCSI.2022.3191111 https://www.wikidata.org/entity/Q114084998 db/journals/tcasI/tcasI69.html#PaksoyC22

Irem Keskinkurt Paksoy Murat Cenk Faster NTRU on ARM Cortex-M4 with TMVP-based multiplication. 300 2022 2022 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2022/300 db/journals/iacr/iacr2022.html#PaksoyC22

Hüsnü Yildiz Murat Cenk Ertan Onur PLGAKD: A PUF-Based Lightweight Group Authentication and Key Distribution Protocol. 5682-5696 2021 8 IEEE Internet Things J. 7 https://doi.org/10.1109/JIOT.2020.3032757 db/journals/iotj/iotj8.html#YildizCO21

Esra Yeniaras Murat Cenk Improved Polynomial Multiplication Algorithms over Characteristic Three Fields and Applications to NTRU Prime. 125-144 2021 SecITC https://doi.org/10.1007/978-3-031-17510-7_9 conf/secitc/2021 db/conf/secitc/secitc2021.html#YeniarasC21 Esra Günsay Cansu Betin Onur Murat Cenk An Improved Range Proof with Base-3 Construction. 1-6 2021 SIN https://doi.org/10.1109/SIN54109.2021.9699258 conf/sin/2021 db/conf/sin/sin2021.html#GunsayOC21

Maryam Sheikhi Garjan N. Gamze Orhon Kiliç Murat Cenk A Supersingular Isogeny-Based Ring Signature. 1318 2021 2021 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2021/1318 db/journals/iacr/iacr2021.html#Sheikhi-GarjanK21

Esra Günsay Cansu Betin Onur Murat Cenk An Improved Range Proof with Base-3 Construction. 1524 2021 2021 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2021/1524 db/journals/iacr/iacr2021.html#GunsayOC21

Erdem Alkim Yusuf Alper Bilgin Murat Cenk François Gérard Cortex-M4 optimizations for {R, M} LWE schemes. 336-357 2020 2020 IACR Trans. Cryptogr. Hardw. Embed. Syst. 3 https://doi.org/10.13154/tches.v2020.i3.336-357 db/journals/tches/tches2020.html#AlkimBCG20

Erdem Alkim Yusuf Alper Bilgin Murat Cenk François Gérard Cortex-M4 Optimizations for \{R, M\}LWE Schemes. 12 2020 2020 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2020/012 db/journals/iacr/iacr2020.html#AlkimBCG20

Irem Keskinkurt Paksoy Murat Cenk TMVP-based Multiplication for Polynomial Quotient Rings and Application to Saber on ARM Cortex-M4. 1302 2020 2020 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2020/1302 db/journals/iacr/iacr2020.html#PaksoyC20

Esra Yeniaras Murat Cenk Faster Characteristic Three Polynomial Multiplication and Its Application to NTRU Prime Decapsulation. 1336 2020 2020 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2020/1336 db/journals/iacr/iacr2020.html#YeniarasC20

Erdem Alkim Yusuf Alper Bilgin Murat Cenk Compact and Simple RLWE Based Key Encapsulation Mechanism. 237-256 2019 LATINCRYPT https://doi.org/10.1007/978-3-030-30530-7_12 conf/latincrypt/2019 db/conf/latincrypt/latincrypt2019.html#AlkimBC19 Metin Evrim Ulu Murat Cenk A Parallel GPU Implementation of SWIFFTX. 202-217 2019 MACIS https://doi.org/10.1007/978-3-030-43120-4_16 conf/macis/2019 db/conf/macis/macis2019.html#UluC19

Murat Cenk Karatsuba-like formulae and their associated techniques. 259-269 2018 8 J. Cryptogr. Eng. 3 https://doi.org/10.1007/s13389-017-0155-8 db/journals/jce/jce8.html#Cenk18

Shoukat Ali Murat Cenk Faster Residue Multiplication Modulo 521-bit Mersenne Prime and an Application to ECC. 2477-2490 2018 65-I IEEE Trans. Circuits Syst. I Regul. Pap. 8 https://doi.org/10.1109/TCSI.2018.2791285 db/journals/tcas/tcasI65.html#AliC18

Murat Cenk Farhad Haghighi Zadeh M. Anwar Hasan New Efficient Algorithms for Multiplication Over Fields of Characteristic Three. 285-294 2018 90 J. Signal Process. Syst. 3 https://doi.org/10.1007/s11265-017-1234-x db/journals/vlsisp/vlsisp90.html#CenkZH18

Halil Kemal Taskin Murat Cenk Speeding up Curve25519 using Toeplitz Matrix-vector Multiplication. 1-6 2018 CS2@HiPEAC https://doi.org/10.1145/3178291.3178292 conf/hipeac/2018cs db/conf/hipeac/cs2018.html#TaskinC18 Ceyda Mangir Murat Cenk Murat Manguoglu An Improved Algorithm for Iterative Matrix-Vector Multiplications over Finite Fields. 358-367 2018 SecITC https://doi.org/10.1007/978-3-030-12942-2_27 conf/secitc/2018 db/conf/secitc/secitc2018.html#MangirCM18

Murat Cenk M. Anwar Hasan On the arithmetic complexity of Strassen-like matrix multiplications. 484-501 2017 80 J. Symb. Comput. https://doi.org/10.1016/j.jsc.2016.07.004 https://www.wikidata.org/entity/Q114154472 db/journals/jsc/jsc80.html#CenkH17

Shoukat Ali Murat Cenk A New Algorithm for Residue Multiplication Modulo 2^521-1. 181-193 2016 ICISC https://doi.org/10.1007/978-3-319-53177-9_9 conf/icisc/2016 db/conf/icisc/icisc2016.html#AliC16

Koksal Mus Mehmet Sabir Kiraz Murat Cenk Isa Sertkaya Estonian Voting Verification Mechanism Revisited. 2016 abs/1612.00668 CoRR http://arxiv.org/abs/1612.00668 db/journals/corr/corr1612.html#MusKCS16

Shoukat Ali Murat Cenk A new algorithm for residue multiplication modulo 2521-1. 138 2016 2016 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2016/138 db/journals/iacr/iacr2016.html#AliC16

Murat Cenk M. Anwar Hasan Some new results on binary polynomial multiplication. 289-303 2015 5 J. Cryptogr. Eng. 4 https://doi.org/10.1007/s13389-015-0101-6 db/journals/jce/jce5.html#CenkH15

Murat Cenk M. Anwar Hasan Some New Results on Binary Polynomial Multiplication. 94 2015 2015 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2015/094 db/journals/iacr/iacr2015.html#CenkH15

Murat Cenk M. Anwar Hasan Christophe Nègre Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination. 2273-2287 2014 63 IEEE Trans. Computers 9 https://doi.org/10.1109/TC.2013.105 http://doi.ieeecomputersociety.org/10.1109/TC.2013.105 db/journals/tc/tc63.html#CenkHN14

Ferruh Özbudak Sedat Akleylek Murat Cenk A New Representation of Elements of Binary Fields with Subquadratic Space Complexity Multiplication of Polynomials. 2016-2024 2013 96-A IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 10 https://doi.org/10.1587/transfun.E96.A.2016 http://search.ieice.org/bin/summary.php?id=e96-a_10_2016 db/journals/ieicet/ieicet96a.html#OzbudakAC13

Sedat Akleylek Murat Cenk Ferruh Özbudak On the generalisation of special moduli for faster interleaved montgomery modular multiplication. 165-171 2013 7 IET Inf. Secur. 3 https://doi.org/10.1049/iet-ifs.2010.0271 db/journals/iet-ifs/iet-ifs7.html#AkleylekCO13

Murat Cenk Christophe Nègre M. Anwar Hasan Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products. 1345-1361 2013 62 IEEE Trans. Computers 7 https://doi.org/10.1109/TC.2012.96 http://doi.ieeecomputersociety.org/10.1109/TC.2012.96 db/journals/tc/tc62.html#CenkNH13

Murat Cenk M. Anwar Hasan On the Arithmetic Complexity of Strassen-Like Matrix Multiplications. 107 2013 2013 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2013/107 db/journals/iacr/iacr2013.html#CenkH13

Sedat Akleylek Murat Cenk Ferruh Özbudak On the Polynomial Multiplication in Chebyshev Form. 584-587 2012 61 IEEE Trans. Computers 4 https://doi.org/10.1109/TC.2011.38 http://doi.ieeecomputersociety.org/10.1109/TC.2011.38 db/journals/tc/tc61.html#AkleylekCO12

Murat Cenk Ferruh Özbudak Efficient multiplications in F55n and F77n. 177-183 2011 236 J. Comput. Appl. Math. 2 https://doi.org/10.1016/j.cam.2011.06.016 https://www.wikidata.org/entity/Q114202152 db/journals/jcam/jcam236.html#CenkO11

Murat Cenk Ferruh Özbudak Multiplication of polynomials modulo xn. 3451-3462 2011 412 Theor. Comput. Sci. 29 https://doi.org/10.1016/j.tcs.2011.02.031 db/journals/tcs/tcs412.html#CenkO11

Murat Cenk Christophe Nègre M. Anwar Hasan Improved Three-Way Split Formulas for Binary Polynomial Multiplication. 384-398 2011 Selected Areas in Cryptography https://doi.org/10.1007/978-3-642-28496-0_23 conf/sacrypt/2011 db/conf/sacrypt/sacrypt2011.html#CenkNH11

Murat Cenk Ferruh Özbudak On multiplication in finite fields. 172-186 2010 26 J. Complex. 2 https://doi.org/10.1016/j.jco.2009.11.002 db/journals/jc/jc26.html#CenkO10

Sedat Akleylek Murat Cenk Ferruh Özbudak Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity. 227-237 2010 INDOCRYPT https://doi.org/10.1007/978-3-642-17401-8_17 conf/indocrypt/2010 db/conf/indocrypt/indocrypt2010.html#AkleylekCO10 Sedat Akleylek Murat Cenk Ferruh Özbudak Faster Montgomery Modular Multiplication without Pre-computational Phase For Some Classes of Finite Fields. 405-408 2010 ISCIS https://doi.org/10.1007/978-90-481-9794-1_75 conf/iscis/2010 db/conf/iscis/iscis2010.html#AkleylekCO10 Murat Cenk Results on complexity of multiplication over finite fields ; Sonlu cisimlerde çarpma karmaşıklığı üzerine sonuçlar. 2009 Middle East Technical University, Çankaya, Ankara, Turkey https://hdl.handle.net/11511/18402 http://etd.lib.metu.edu.tr/upload/3/12610363/index.pdf https://www.base-search.net/Record/cb55d3aea019918dacf1e706a9dfef04f8913a915c480fb80cc940c52f1571be base-search.net (ftmetuankair:oai:https://open.metu.edu.tr:11511/18402)

Murat Cenk Ferruh Özbudak Improved Polynomial Multiplication Formulas over $IF2$ Using Chinese Remainder Theorem. 572-576 2009 58 IEEE Trans. Computers 4 https://doi.org/10.1109/TC.2008.207 http://doi.ieeecomputersociety.org/10.1109/TC.2008.207 db/journals/tc/tc58.html#CenkO09

Murat Cenk Çetin Kaya Koç Ferruh Özbudak Polynomial Multiplication over Finite Fields Using Field Extensions and Interpolation. 84-91 2009 IEEE Symposium on Computer Arithmetic https://doi.org/10.1109/ARITH.2009.11 https://doi.ieeecomputersociety.org/10.1109/ARITH.2009.11 conf/arith/2009 db/conf/arith/arith2009.html#CenkKO09 Murat Cenk Ferruh Özbudak Efficient Multiplication in F3kn, m>=1 and 5<=l<=18. 406-414 2008 AFRICACRYPT https://doi.org/10.1007/978-3-540-68164-9_27 conf/africacrypt/2008 db/conf/africacrypt/africacrypt2008.html#CenkO08 Joseph A. Akinyele Sedat Akleylek Shoukat Ali Erdem Alkim Yusuf Alper Bilgin Muhammad ElSheikh François Gérard Anil Burak Gökce Neslihan Yaman Gökce Esra Günsay M. Anwar Hasan N. Gamze Orhon Kiliç Mehmet Sabir Kiraz Çetin Kaya Koç Aanchal Malhotra Tushin Mallick Ceyda Mangir Murat Manguoglu Koksal Mus Christophe Nègre Cristina Nita-Rotaru Cansu Betin Onur Ertan Onur Ferruh Özbudak Irem Keskinkurt Paksoy Isa Sertkaya Maryam SheikhiMaryam Sheikhi Garjan Halil Kemal Taskin Nazli Deniz Türe Metin Evrim Ulu Oguz Yayla Esra Yeniaras Hüsnü Yildiz Farhad Haghighi Zadeh Maya Zeldin