Yazar "Ozbudak, Ferruh" için listeleme
-
Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity
Akleylek, Sedat; Ozbudak, Ferruh (Ieee Computer Soc, 2012)We give a modified redundant representation for designing arithmetic circuits with small complexity. Using our modified redundant representation, we improve many of the complexity values significantly. Our method works for ... -
Multiplication in a Galois Ring
Akleylek, Sedat; Ozbudak, Ferruh (Ieee, 2015)In this paper, we focus on the efficient multiplication in a Galois ring of the size 4(n), where n is a positive integer. We consider to adapt the finite field multiplication methods to the Galois ring multiplication. We ... -
A New Representation of Elements of Binary Fields with Subquadratic Space Complexity Multiplication of Polynomials
Ozbudak, Ferruh; Akleylek, Sedat; Cenk, Murat (Ieice-Inst Electronics Information Communications Eng, 2013)In this paper, Hermite polynomial representation is proposed as an alternative way to represent finite fields of characteristic two. We show that multiplication in Hermite polynomial representation can be achieved with ... -
On the generalisation of special moduli for faster interleaved montgomery modular multiplication
Akleylek, Sedat; Cenk, Murat; Ozbudak, Ferruh (Inst Engineering Technology-Iet, 2013)In this study, the authors give a generalisation of special moduli for faster interleaved Montgomery modular multiplication algorithm with simplified pre-computational phase for GF(p(n)), where p 2 is a prime number and n ... -
On the Polynomial Multiplication in Chebyshev Form
Akleylek, Sedat; Cenk, Murat; Ozbudak, Ferruh (Ieee Computer Soc, 2012)We give an efficient multiplication method for polynomials in Chebyshev form. This multiplication method is different from the previous ones. Theoretically, we show that the number of multiplications is at least as good ...
