摘要
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 12月 |
ASJC Scopus subject areas
- 軟體
- 資訊系統
- 電腦網路與通信