Yazar "Özbudak F." için listeleme
-
Faster Montgomery modular multiplication without pre-computational phase for some classes of finite fields
Akleylek S.; Cenk M.; Özbudak F. (2010)In this paper, we give faster versions of Montgomery modular multiplication algorithm without pre-computational phase for GF(p) and GF(2m ) which can be considered as a generalization of [3], [4] and [5]. We propose sets ... -
Polynomial multiplication over binary fields using charlier polynomial representation with low space complexity
Akleylek S.; Cenk M.; Özbudak F. (2010)In this paper, we give a new way to represent certain finite fields GF(2n ). This representation is based on Charlier polynomials. We show that multiplication in Charlier polynomial representation can be performed with ...
