Palindromic-like representation for Gaussian normal basis multiplier over GF(2 m ) with odd type t
Che-Wun Chiou, Tai‐Pao Chuang, Shaofu Lin, Chiou‐Yng Lee, J.-M. Lin, Y.-C. Yeh · IET Information Security · 2012
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.