 | 2012 |
|---|
| 10 |       | Sedat Akleylek,
Murat Cenk,
Ferruh Özbudak:
On the Polynomial Multiplication in Chebyshev Form.
IEEE Trans. Computers 61(4): 584-587 (2012) |
| 2011 |
|---|
| 9 | | Murat Cenk,
Christophe Nègre,
M. Anwar Hasan:
Improved Three-Way Split Formulas for Binary Polynomial Multiplication.
Selected Areas in Cryptography 2011: 384-398 |
| 8 | | Murat Cenk,
Ferruh Özbudak:
Efficient multiplications in F55n and F77n.
J. Computational Applied Mathematics 236(2): 177-183 (2011) |
| 7 | | Murat Cenk,
Ferruh Özbudak:
Multiplication of polynomials modulo xn.
Theor. Comput. Sci. 412(29): 3451-3462 (2011) |
| 2010 |
|---|
| 6 | | Sedat Akleylek,
Murat Cenk,
Ferruh Özbudak:
Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity.
INDOCRYPT 2010: 227-237 |
| 5 | | Sedat Akleylek,
Murat Cenk,
Ferruh Özbudak:
Faster Montgomery Modular Multiplication without Pre-computational Phase For Some Classes of Finite Fields.
ISCIS 2010: 405-408 |
| 4 | | Murat Cenk,
Ferruh Özbudak:
On multiplication in finite fields.
J. Complexity 26(2): 172-186 (2010) |
| 2009 |
|---|
| 3 | | 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 |
| 2 | | Murat Cenk,
Ferruh Özbudak:
Improved Polynomial Multiplication Formulas over $IF2$ Using Chinese Remainder Theorem.
IEEE Trans. Computers 58(4): 572-576 (2009) |
| 2008 |
|---|
| 1 | | Murat Cenk,
Ferruh Özbudak:
Efficient Multiplication in F3kn, m>=1 and 5<=l<=18.
AFRICACRYPT 2008: 406-414 |
Data released under the ODC-BY 1.0 license — See also our legal information page