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

*此作品的通信作者

研究成果: 雜誌貢獻期刊論文同行評審

5 引文 斯高帕斯(Scopus)

摘要

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.

原文英語
頁(從 - 到)318-323
頁數6
期刊IET Information Security
6
發行號4
DOIs
出版狀態已發佈 - 2012 十二月

ASJC Scopus subject areas

  • 軟體
  • 資訊系統
  • 電腦網路與通信

引用此