Acta Applicandae Mathematica

, Volume 93, Issue 1–3, pp 33–55

Polynomial Basis Multiplication over GF(2m)

  • Serdar S. Erdem
  • Tuğrul Yanık
  • Çetin K. Koç

DOI: 10.1007/s10440-006-9047-0

Cite this article as:
Erdem, S.S., Yanık, T. & Koç, Ç.K. Acta Appl Math (2006) 93: 33. doi:10.1007/s10440-006-9047-0


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 

Copyright information

© Springer Science + Business Media B.V. 2006

Authors and Affiliations

  • Serdar S. Erdem
    • 1
  • Tuğrul Yanık
    • 2
  • Çetin K. Koç
    • 3
  1. 1.Electronics Engineering DepartmentGebze Institute of TechnologyGebzeTurkey
  2. 2.Computer Engineering DepartmentFatih UniversityIstanbulTurkey
  3. 3.Information Security Research CenterIstanbul Commerce UniversityIstanbulTurkey

Personalised recommendations