Polynomial basis multiplication over GF(2 m)

Erdem S. S., Yanik T., Koç Ç. K.

Acta Applicandae Mathematicae, vol.93, no.1-3, pp.33-55, 2006 (SCI-Expanded, Scopus) identifier identifier

  • Publication Type: Article / Article
  • Volume: 93 Issue: 1-3
  • Publication Date: 2006
  • Doi Number: 10.1007/s10440-006-9047-0
  • Journal Name: Acta Applicandae Mathematicae
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.33-55
  • Keywords: finite fields, binary fields, computer arithmetic, modular multiplication, modular reduction
  • İstanbul Ticaret University Affiliated: Yes

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.