Palindromic-like representation for Gaussian normal basis multiplier over GF(2m) with odd type t

C. W. Chiou, T. P. Chuang, S. S. Lin, C. Y. Lee, J. M. Lin, Y. C. Yeh

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Palindromic representation is generally used to reduce space and time complexities in Gaussian normal basis (GNB) multiplier with even type t. However, palindromic representation is inapplicable for a GNB multiplier with odd type t ($t \geq 2$). This study therefore develops a palindromic-like representation for a GNB multiplier with odd type t. The proposed systolic GNB multiplier with odd type t reduces space and time complexities by as much as 50 compared with conventional GNB multiplier with odd type t without palindromic representation.

Original languageEnglish
Pages (from-to)318-323
Number of pages6
JournalIET Information Security
Volume6
Issue number4
DOIs
Publication statusPublished - 2012 Dec 1

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Computer Networks and Communications

Cite this