Acta Applicandae Mathematica

, Volume 93, Issue 1, pp 33-55

First online:

Polynomial Basis Multiplication over GF(2 m )

  • Serdar S. ErdemAffiliated withElectronics Engineering Department, Gebze Institute of Technology Email author 
  • , Tuğrul YanıkAffiliated withComputer Engineering Department, Fatih University
  • , Çetin K. KoçAffiliated withInformation Security Research Center, Istanbul Commerce University

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.

Mathematics Subject Classifications (2000)

12-XX 68-XX 94-XX

Key words

finite fields binary fields computer arithmetic modular multiplication modular reduction