DSpace Repository

Efficient multiplication in F-3lm, m >= 1 and 5 <= l <= 18

Show simple item record

dc.contributor.author Cenk, Murat
dc.contributor.author Özbudak, Ferruh
dc.date.accessioned 2020-04-08T12:20:21Z
dc.date.available 2020-04-08T12:20:21Z
dc.date.issued 2008
dc.identifier.citation Cenk, Murat; Özbudak, Ferruh, "Efficient multiplication in F-3lm, m >= 1 and 5 <= l <= 18", Progress In Cryptology - Africacrypt 2008, Vol.5023, (2008). tr_TR
dc.identifier.issn 0302-9743
dc.identifier.uri http://hdl.handle.net/20.500.12416/2968
dc.description.abstract 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. tr_TR
dc.language.iso eng tr_TR
dc.publisher Springer-Verlag Berlin tr_TR
dc.rights info:eu-repo/semantics/closedAccess tr_TR
dc.subject Chinese Remainder Theorem tr_TR
dc.subject Finite Field Multiplication tr_TR
dc.subject Pairing Based Cryptography tr_TR
dc.title Efficient multiplication in F-3lm, m >= 1 and 5 <= l <= 18 tr_TR
dc.type workingPaper tr_TR
dc.relation.journal Progress In Cryptology - Africacrypt 2008 tr_TR
dc.identifier.volume 5023 tr_TR
dc.contributor.department Çankaya Üniversitesi, Fen Edebiyat Fakültesi, Matematik Bölümü tr_TR


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record