Polynomial basis multiplication over GF(2 m)
dc.contributor.author | Erdem, Serdar Süer | |
dc.contributor.author | Yanık, Tuğrul | |
dc.contributor.author | Koç, Çetin Kaya | |
dc.date.accessioned | 2020-11-21T15:53:23Z | |
dc.date.available | 2020-11-21T15:53:23Z | |
dc.date.issued | 2006 | en_US |
dc.department | İstanbul Ticaret Üniversitesi | en_US |
dc.description.abstract | In this paper, we describe, analyze and compare various GF(2 m) multipliers. Particularly, we investigate the standard modular multiplication, the Montgomery multiplication, and the matrix-vector multiplication techniques. © Springer Science + Business Media B.V. 2006. | en_US |
dc.identifier.doi | 10.1007/s10440-006-9047-0 | en_US |
dc.identifier.endpage | 55 | en_US |
dc.identifier.issn | 0167-8019 | |
dc.identifier.issue | 01.Mar | en_US |
dc.identifier.scopus | 2-s2.0-33749515474 | en_US |
dc.identifier.scopusquality | Q2 | en_US |
dc.identifier.startpage | 33 | en_US |
dc.identifier.uri | https://doi.org/10.1007/s10440-006-9047-0 | |
dc.identifier.uri | https://hdl.handle.net/11467/3564 | |
dc.identifier.volume | 93 | en_US |
dc.identifier.wos | WOS:000241115800003 | en_US |
dc.identifier.wosquality | Q4 | en_US |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartof | Acta Applicandae Mathematicae | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Binary fields | en_US |
dc.subject | Computer arithmetic | en_US |
dc.subject | Finite fields | en_US |
dc.subject | Modular multiplication | en_US |
dc.subject | Modular reduction | en_US |
dc.title | Polynomial basis multiplication over GF(2 m) | en_US |
dc.type | Article | en_US |