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.
|Number of pages||6|
|Journal||IET Information Security|
|Publication status||Published - 2012 Dec|
ASJC Scopus subject areas
- Information Systems
- Computer Networks and Communications