default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMurat Cenk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]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: 103688 (2024)- [j19]Esra Günsay, Cansu Betin Onur, Murat Cenk:
A different base approach for better efficiency on range proofs. J. Inf. Secur. Appl. 85: 103860 (2024) - [i12]Nazli Deniz Türe, Murat Cenk:
Efficient Batch Algorithms for the Post-Quantum Crystals Dilithium Signature Scheme and Crystals Kyber Encryption Scheme. IACR Cryptol. ePrint Arch. 2024: 1397 (2024) - 2023
- [i11]Esra Günsay, Cansu Betin Onur, Murat Cenk:
A Different Base Approach for Better Efficiency on Range Proofs. IACR Cryptol. ePrint Arch. 2023: 203 (2023) - 2022
- [j18]Esra Yeniaras, Murat Cenk:
Faster characteristic three polynomial multiplication and its application to NTRU Prime decapsulation. J. Cryptogr. Eng. 12(3): 329-348 (2022) - [j17]Irem Keskinkurt Paksoy, Murat Cenk:
Faster NTRU on ARM Cortex-M4 With TMVP-Based Multiplication. IEEE Trans. Circuits Syst. I Regul. Pap. 69(10): 4083-4092 (2022) - [i10]Irem Keskinkurt Paksoy, Murat Cenk:
Faster NTRU on ARM Cortex-M4 with TMVP-based multiplication. IACR Cryptol. ePrint Arch. 2022: 300 (2022) - 2021
- [j16]Hüsnü Yildiz, Murat Cenk, Ertan Onur:
PLGAKD: A PUF-Based Lightweight Group Authentication and Key Distribution Protocol. IEEE Internet Things J. 8(7): 5682-5696 (2021) - [c12]Esra Yeniaras, Murat Cenk:
Improved Polynomial Multiplication Algorithms over Characteristic Three Fields and Applications to NTRU Prime. SecITC 2021: 125-144 - [c11]Esra Günsay, Cansu Betin Onur, Murat Cenk:
An Improved Range Proof with Base-3 Construction. SIN 2021: 1-6 - [i9]Maryam Sheikhi Garjan, N. Gamze Orhon Kiliç, Murat Cenk:
A Supersingular Isogeny-Based Ring Signature. IACR Cryptol. ePrint Arch. 2021: 1318 (2021) - [i8]Esra Günsay, Cansu Betin Onur, Murat Cenk:
An Improved Range Proof with Base-3 Construction. IACR Cryptol. ePrint Arch. 2021: 1524 (2021) - 2020
- [j15]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): 336-357 (2020) - [i7]Erdem Alkim, Yusuf Alper Bilgin, Murat Cenk, François Gérard:
Cortex-M4 Optimizations for \{R, M\}LWE Schemes. IACR Cryptol. ePrint Arch. 2020: 12 (2020) - [i6]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: 1302 (2020) - [i5]Esra Yeniaras, Murat Cenk:
Faster Characteristic Three Polynomial Multiplication and Its Application to NTRU Prime Decapsulation. IACR Cryptol. ePrint Arch. 2020: 1336 (2020)
2010 – 2019
- 2019
- [c10]Erdem Alkim, Yusuf Alper Bilgin, Murat Cenk:
Compact and Simple RLWE Based Key Encapsulation Mechanism. LATINCRYPT 2019: 237-256 - [c9]Metin Evrim Ulu, Murat Cenk:
A Parallel GPU Implementation of SWIFFTX. MACIS 2019: 202-217 - 2018
- [j14]Murat Cenk:
Karatsuba-like formulae and their associated techniques. J. Cryptogr. Eng. 8(3): 259-269 (2018) - [j13]Shoukat Ali, Murat Cenk:
Faster Residue Multiplication Modulo 521-bit Mersenne Prime and an Application to ECC. IEEE Trans. Circuits Syst. I Regul. Pap. 65-I(8): 2477-2490 (2018) - [j12]Murat Cenk, Farhad Haghighi Zadeh, M. Anwar Hasan:
New Efficient Algorithms for Multiplication Over Fields of Characteristic Three. J. Signal Process. Syst. 90(3): 285-294 (2018) - [c8]Halil Kemal Taskin, Murat Cenk:
Speeding up Curve25519 using Toeplitz Matrix-vector Multiplication. CS2@HiPEAC 2018: 1-6 - [c7]Ceyda Mangir, Murat Cenk, Murat Manguoglu:
An Improved Algorithm for Iterative Matrix-Vector Multiplications over Finite Fields. SecITC 2018: 358-367 - 2017
- [j11]Murat Cenk, M. Anwar Hasan:
On the arithmetic complexity of Strassen-like matrix multiplications. J. Symb. Comput. 80: 484-501 (2017) - 2016
- [c6]Shoukat Ali, Murat Cenk:
A New Algorithm for Residue Multiplication Modulo 2^521-1. ICISC 2016: 181-193 - [i4]Koksal Mus, Mehmet Sabir Kiraz, Murat Cenk, Isa Sertkaya:
Estonian Voting Verification Mechanism Revisited. CoRR abs/1612.00668 (2016) - [i3]Shoukat Ali, Murat Cenk:
A new algorithm for residue multiplication modulo 2521-1. IACR Cryptol. ePrint Arch. 2016: 138 (2016) - 2015
- [j10]Murat Cenk, M. Anwar Hasan:
Some new results on binary polynomial multiplication. J. Cryptogr. Eng. 5(4): 289-303 (2015) - [i2]Murat Cenk, M. Anwar Hasan:
Some New Results on Binary Polynomial Multiplication. IACR Cryptol. ePrint Arch. 2015: 94 (2015) - 2014
- [j9]Murat Cenk, M. Anwar Hasan, Christophe Nègre:
Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination. IEEE Trans. Computers 63(9): 2273-2287 (2014) - 2013
- [j8]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. 96-A(10): 2016-2024 (2013) - [j7]Sedat Akleylek, Murat Cenk, Ferruh Özbudak:
On the generalisation of special moduli for faster interleaved montgomery modular multiplication. IET Inf. Secur. 7(3): 165-171 (2013) - [j6]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): 1345-1361 (2013) - [i1]Murat Cenk, M. Anwar Hasan:
On the Arithmetic Complexity of Strassen-Like Matrix Multiplications. IACR Cryptol. ePrint Arch. 2013: 107 (2013) - 2012
- [j5]Sedat Akleylek, Murat Cenk, Ferruh Özbudak:
On the Polynomial Multiplication in Chebyshev Form. IEEE Trans. Computers 61(4): 584-587 (2012) - 2011
- [j4]Murat Cenk, Ferruh Özbudak:
Efficient multiplications in F55n and F77n. J. Comput. Appl. Math. 236(2): 177-183 (2011) - [j3]Murat Cenk, Ferruh Özbudak:
Multiplication of polynomials modulo xn. Theor. Comput. Sci. 412(29): 3451-3462 (2011) - [c5]Murat Cenk, Christophe Nègre, M. Anwar Hasan:
Improved Three-Way Split Formulas for Binary Polynomial Multiplication. Selected Areas in Cryptography 2011: 384-398 - 2010
- [j2]Murat Cenk, Ferruh Özbudak:
On multiplication in finite fields. J. Complex. 26(2): 172-186 (2010) - [c4]Sedat Akleylek, Murat Cenk, Ferruh Özbudak:
Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity. INDOCRYPT 2010: 227-237 - [c3]Sedat Akleylek, Murat Cenk, Ferruh Özbudak:
Faster Montgomery Modular Multiplication without Pre-computational Phase For Some Classes of Finite Fields. ISCIS 2010: 405-408
2000 – 2009
- 2009
- [j1]Murat Cenk, Ferruh Özbudak:
Improved Polynomial Multiplication Formulas over $IF2$ Using Chinese Remainder Theorem. IEEE Trans. Computers 58(4): 572-576 (2009) - [c2]Murat Cenk, Çetin Kaya Koç, Ferruh Özbudak:
Polynomial Multiplication over Finite Fields Using Field Extensions and Interpolation. IEEE Symposium on Computer Arithmetic 2009: 84-91 - 2008
- [c1]Murat Cenk, Ferruh Özbudak:
Efficient Multiplication in F3kn, m>=1 and 5<=l<=18. AFRICACRYPT 2008: 406-414
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 02:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
