Murat Cenk
Murat Cenk
Verified email at
Cited by
Cited by
Cortex-M4 optimizations for {R, M} LWE schemes
E Alkim, YA Bilgin, M Cenk, F Gérard
IACR Transactions on Cryptographic Hardware and Embedded Systems, 336-357, 2020
On multiplication in finite fields
M Cenk, F Özbudak
Journal of Complexity 26 (2), 172-186, 2010
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
PLGAKD: A PUF-based lightweight group authentication and key distribution protocol
H Yıldız, M Cenk, E Onur
IEEE Internet of Things Journal 8 (7), 5682-5696, 2020
On the arithmetic complexity of Strassen-like matrix multiplications
M Cenk, MA Hasan
Journal of Symbolic Computation 80, 484-501, 2017
Improved Polynomial Multiplication Formulas over $ IF₂ $ Using Chinese Remainder Theorem
M Cenk, F Ozbudak
IEEE Transactions on computers 58 (4), 572-576, 2008
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
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
Compact and simple RLWE based key encapsulation mechanism
E Alkım, YA Bilgin, M Cenk
Progress in Cryptology–LATINCRYPT 2019: 6th International Conference on …, 2019
Some new results on binary polynomial multiplication
M Cenk, MA Hasan
Journal of Cryptographic Engineering 5, 289-303, 2015
Efficient Multiplication in, m≥ 1 and 5≤ ℓ≤ 18
M Cenk, F Özbudak
International Conference on Cryptology in Africa, 406-414, 2008
Efficient big integer multiplication in cryptography
MB Ilter, C Murat
International Journal of Information Security Science 6 (4), 70-78, 2017
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
Multiplication of polynomials modulo xn
M Cenk, F Özbudak
Theoretical computer science 412 (29), 3451-3462, 2011
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
Polynomial multiplication over binary fields using Charlier polynomial representation with low space complexity
S Akleylek, M Cenk, F Özbudak
Progress in Cryptology-INDOCRYPT 2010: 11th International Conference on …, 2010
Surface terms, angular momentum and Hamilton-Jacobi formalism
Y Guler, D Baleanu, M Cenk
arXiv preprint gr-qc/0310093, 2003
Tmvp-based multiplication for polynomial quotient rings and application to saber on arm cortex-m4
IK Paksoy, M Cenk
Cryptology ePrint Archive, 2020
Estonian voting verification mechanism revisited
K Mus, MS Kiraz, M Cenk, I Sertkaya
CoRR, abs 1612, 2016
Karatsuba-like formulae and their associated techniques
M Cenk
Journal of Cryptographic Engineering 8, 259-269, 2018
The system can't perform the operation now. Try again later.
Articles 1–20