Murat Cenk
Murat Cenk
Verified email at metu.edu.tr
Title
Cited by
Cited by
Year
On multiplication in finite fields
M Cenk, F Özbudak
Journal of Complexity 26 (2), 172-186, 2010
362010
Improved three-way split formulas for binary polynomial and Toeplitz matrix vector products
M Cenk, C Negre, MA Hasan
IEEE Transactions on Computers 62 (7), 1345-1361, 2012
252012
Improved Polynomial Multiplication Formulas over $ IF₂ $ Using Chinese Remainder Theorem
M Cenk, F Ozbudak
IEEE Transactions on computers 58 (4), 572-576, 2008
222008
On the arithmetic complexity of Strassen-like matrix multiplications
M Cenk, MA Hasan
Journal of Symbolic Computation 80, 484-501, 2017
172017
Polynomial multiplication over finite fields using field extensions and interpolation
M Cenk, CK Koç, F Ozbudak
2009 19th IEEE Symposium on Computer Arithmetic, 84-91, 2009
172009
Efficient Multiplication in , m ≥ 1 and 5 ≤ ℓ ≤ 18
M Cenk, F Özbudak
International Conference on Cryptology in Africa, 406-414, 2008
172008
Efficient subquadratic space complexity binary polynomial multipliers based on block recombination
M Cenk, MA Hasan, C Negre
IEEE Transactions on Computers 63 (9), 2273-2287, 2013
162013
On distributed computing systems reliability analysis under program execution constraints
DJ Chen, MS Lin
IEEE transactions on computers 43 (1), 87-97, 1994
161994
Some new results on binary polynomial multiplication
M Cenk, MA Hasan
Journal of Cryptographic Engineering 5 (4), 289-303, 2015
122015
Surface terms, angular momentum and Hamilton-Jacobi formalism
Y Guler, D Baleanu, M Cenk
arXiv preprint gr-qc/0310093, 2003
92003
Improved three-way split formulas for binary polynomial multiplication
M Cenk, C Negre, MA Hasan
International Workshop on Selected Areas in Cryptography, 384-398, 2011
82011
Multiplication of polynomials modulo xn
M Cenk, F Özbudak
Theoretical computer science 412 (29), 3451-3462, 2011
82011
Polynomial multiplication over binary fields using Charlier polynomial representation with low space complexity
S Akleylek, M Cenk, F Özbudak
International Conference on Cryptology in India, 227-237, 2010
62010
Faster residue multiplication modulo 521-bit Mersenne prime and an application to ECC
S Ali, M Cenk
IEEE Transactions on Circuits and Systems I: Regular Papers 65 (8), 2477-2490, 2018
52018
A new representation of elements of binary fields with subquadratic space complexity multiplication of polynomials
F Özbudak, S Akleylek, M Cenk
IEICE Transactions on Fundamentals of Electronics, Communications and …, 2013
52013
Cortex-M4 Optimizations for {R, M\} LWE Schemes.
E Alkim, YA Bilgin, M Cenk, F Gérard
IACR Cryptol. ePrint Arch. 2020, 12, 2020
42020
Estonian voting verification mechanism revisited
K Mus, MS Kiraz, M Cenk, I Sertkaya
CoRR, abs 1612, 2016
32016
A New Algorithm for Residue Multiplication Modulo
S Ali, M Cenk
International Conference on Information Security and Cryptology, 181-193, 2016
32016
On the polynomial multiplication in Chebyshev form
S Akleylek, M Cenk, F Ozbudak
IEEE Transactions on Computers 61 (4), 584-587, 2011
32011
Compact and simple RLWE based key encapsulation mechanism
E Alkım, YA Bilgin, M Cenk
International Conference on Cryptology and Information Security in Latin …, 2019
22019
The system can't perform the operation now. Try again later.
Articles 1–20