Çankaya GCRIS Standart veritabanının içerik oluşturulması ve kurulumu Research Ecosystems (https://www.researchecosystems.com) tarafından devam etmektedir. Bu süreçte gördüğünüz verilerde eksikler olabilir.
 

Cenk, Murat

Profile Picture
Name Variants
Job Title
Öğr. Gör. Dr.
Email Address
Main Affiliation
Matematik
Status
Former Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals Report Points

SDG data could not be loaded because of an error. Please refresh the page or try again later.
Scholarly Output

6

Articles

6

Citation Count

65

Supervised Theses

1

Filters

2003 - 20106
Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 6 of 6
  • Thumbnail Image
    Conference Object
    Citation - WoS: 5
    Citation - Scopus: 8
    Efficient multiplication in F-3lm, m >= 1 and 5 <= l <= 18
    (Springer-verlag Berlin, 2008) Cenk, Murat; Cenk, Murat; Ozbudak, Ferruh; Matematik
    Using a method based on Chinese Remainder Theorem for polynomial multiplication and suitable reductions, we obtain an efficient multiplication method for finite fields of characteristic 3. Large finite fields of characteristic 3 are important for pairing based cryptography [3]. For 5 <= l <= 18, we show that our method gives canonical multiplication formulae over F-3lm for any m >= 1 with the best multiplicative complexity improving the bounds in [6]. We give explicit formula in the case F-36.97.
  • Thumbnail Image
    Conference Object
    Citation - WoS: 7
    Citation - Scopus: 14
    Polynomial multiplication over finite fields using field extensions and interpolation
    (Ieee Computer Soc, 2009) Cenk, Murat; Cenk, Murat; Koc, Cetin Kaya; Ozbudak, Ferruh; 220172; Matematik
    A method for polynomial multiplication over finite fields using field extensions and polynomial interpolation is introduced. The proposed method uses polynomial interpolation as Toom-Cook method together with field extensions. Furthermore, the proposed method can be used when Toom-Cook method cannot be applied directly. Explicit formulae improving the previous results in many cases are obtained.
  • Thumbnail Image
    Master Thesis
    New geometrical aspects of constrained system
    (2003) Cenk, Murat; Matematik
    Bağıl sistemler yeni bir geometrik bakışla incelendi ve integrallenebilir geometrilerin yüzey terimlerinin önemi vurgulandı. Klasik mekaniğin geometrik formülasyonu ve simplektik geometri kısaca sunuldu
  • Thumbnail Image
    Article
    Citation - WoS: 22
    Citation - Scopus: 27
    On Multiplication In Finite Fields
    (Academic Press inc Elsevier Science, 2010) Cenk, Murat; Cenk, Murat; Ozbudak, Ferruh; 6093; Matematik
    We present a method for multiplication in finite fields which gives multiplication algorithms with improved or best known bilinear complexities for certain finite fields. Our method generalizes some earlier methods and combines them with the recently introduced complexity notion (M) over cap (q)(l), which denotes the minimum number of multiplications needed in F-q in order to obtain the coefficients of the product of two arbitrary l-term polynomials modulo x(l) in F-q[x]. We study our method for the finite fields F(q)n, where 2 <= n <= 18 and q = 2, 3,4 and we improve or reach the currently best known bilinear complexities. We also give some applications in cryptography. (C) 2010 Published by Elsevier Inc.
  • Thumbnail Image
    Article
    Isomorphism classes of ordinary elliptic curves over fields of characteristic 3
    (2007) Cenk, Murat; Özbudak, Ferruh; Matematik
    Ordinary elliptic curves over fields of characteristic 3 can be represented by y 2 = x 3 + ax 2 + b where a, b ≠ 0 ∈ . In this paper we count the number of different isomorphism classes of ordinary elliptic curves over finite fields of characteristic three. We show there are (2q−2) different isomorphism classes.
  • Thumbnail Image
    Article
    Citation - WoS: 12
    Citation - Scopus: 17
    Improved polynomial multiplication formulas over F-2 using chinese remainder theorem
    (Ieee Computer Soc, 2009) Cenk, Murat; Cenk, Murat; Ozbudak, Ferruh; 220172; 2212; Matematik
    Let n and l be positive integers and f(x) be an irreducible polynomial over F-2 such that ldeg(f(x)) < 2n - 1. We obtain an effective upper bound for the multiplication complexity of n-term polynomials modulo f(x)(l). This upper bound allows a better selection of the moduli when the Chinese Remainder Theorem is used for polynomial multiplication over F-2. We give improved formulas to multiply polynomials of small degree over F-2. In particular, we improve the best known multiplication complexities over F-2 in the literature in some cases.