Erdem, Serdar SüerYanık, TuğrulKoç, Çetin Kaya2020-11-212020-11-2120060167-8019https://doi.org/10.1007/s10440-006-9047-0https://hdl.handle.net/11467/3564In 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.eninfo:eu-repo/semantics/closedAccessBinary fieldsComputer arithmeticFinite fieldsModular multiplicationModular reductionPolynomial basis multiplication over GF(2 m)Article9301.Mar3355Q4WOS:000241115800003Q22-s2.0-3374951547410.1007/s10440-006-9047-0