Murat Cenk
Murat Cenk
Verified email at metu.edu.tr
TitleCited byYear
On multiplication in finite fields
M Cenk, F Özbudak
Journal of Complexity 26 (2), 172-186, 2010
332010
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, 2013
242013
Improved Polynomial Multiplication Formulas over $ IF₂ $ Using Chinese Remainder Theorem
M Cenk, F Ozbudak
IEEE Transactions on computers 58 (4), 572-576, 2009
212009
Polynomial multiplication over finite fields using field extensions and interpolation
M Cenk, CK Koç, F Ozbudak
Computer Arithmetic, 2009. ARITH 2009. 19th IEEE Symposium on, 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
152008
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, 2014
112014
On the arithmetic complexity of Strassen-like matrix multiplications
M Cenk, MA Hasan
Journal of Symbolic Computation 80, 484-501, 2017
92017
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
Surface terms, angular momentum and Hamilton-Jacobi formalism
Y Guler, D Baleanu, M Cenk
arXiv preprint gr-qc/0310093, 2003
82003
Some new results on binary polynomial multiplication
M Cenk, MA Hasan
Journal of Cryptographic Engineering 5 (4), 289-303, 2015
72015
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
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
On the polynomial multiplication in Chebyshev form
S Akleylek, M Cenk, F Ozbudak
IEEE Transactions on Computers 61 (4), 584-587, 2012
32012
Estonian voting verification mechanism revisited
MS Kiraz, M Cenk, I Sertkaya
arXiv preprint arXiv:1612.00668, 2016
22016
A New Algorithm for Residue Multiplication Modulo
S Ali, M Cenk
International Conference on Information Security and Cryptology, 181-193, 2016
22016
Efficient multiplication in finite fields of characteristic 3 and 5 for pairing based cryptography
M Cenk, F Özbudak
3rd Information Security and Cryptology Conference, Ankara, 111-114, 2008
22008
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, 1-14, 2018
12018
On the generalisation of special moduli for faster interleaved montgomery modular multiplication
S Akleylek, M Cenk, F Özbudak
IET Information Security 7 (3), 165-171, 2013
12013
Faster montgomery modular multiplication without pre-computational phase for some classes of finite fields
S Akleylek, M Cenk, F Özbudak
Computer and Information Sciences, 405-408, 2011
12011
The system can't perform the operation now. Try again later.
Articles 1–20