Polynomial basis multiplication over GF(2 m)

dc.contributor.authorErdem, Serdar Süer
dc.contributor.authorYanık, Tuğrul
dc.contributor.authorKoç, Çetin Kaya
dc.date.accessioned2020-11-21T15:53:23Z
dc.date.available2020-11-21T15:53:23Z
dc.date.issued2006en_US
dc.departmentİstanbul Ticaret Üniversitesien_US
dc.description.abstractIn 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.doi10.1007/s10440-006-9047-0en_US
dc.identifier.endpage55en_US
dc.identifier.issn0167-8019
dc.identifier.issue01.Maren_US
dc.identifier.scopus2-s2.0-33749515474en_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.startpage33en_US
dc.identifier.urihttps://doi.org/10.1007/s10440-006-9047-0
dc.identifier.urihttps://hdl.handle.net/11467/3564
dc.identifier.volume93en_US
dc.identifier.wosWOS:000241115800003en_US
dc.identifier.wosqualityQ4en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.relation.ispartofActa Applicandae Mathematicaeen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectBinary fieldsen_US
dc.subjectComputer arithmeticen_US
dc.subjectFinite fieldsen_US
dc.subjectModular multiplicationen_US
dc.subjectModular reductionen_US
dc.titlePolynomial basis multiplication over GF(2 m)en_US
dc.typeArticleen_US

Dosyalar