By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
C. W. Chiou ; Dept. of Comput. Sci. & Inf. Eng., Chien Hsin Univ. of Sci. & Technol., Jhongli, Taiwan ; T. -P. Chuang ; S. -S. Lin ; C. -Y. Lee
more authors

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 ≥ 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.

Published in:

IET Information Security  (Volume:6 ,  Issue: 4 )