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

doi:10.1049/iet-ifs.2012.0200

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

^*Corresponding author for this work

Department of Computer Science and Information Engineering

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	318-323
Number of pages	6
Journal	IET Information Security
Volume	6
Issue number	4
DOIs	https://doi.org/10.1049/iet-ifs.2012.0200
Publication status	Published - 2012 Dec

ASJC Scopus subject areas

Software
Information Systems
Computer Networks and Communications

Access to Document

10.1049/iet-ifs.2012.0200

Cite this

@article{fcd0c28ca8924b3bb9a05761d696bbfc,

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

abstract = "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.",

author = "Chiou, {C. W.} and Chuang, {T. P.} and Lin, {S. S.} and Lee, {C. Y.} and Lin, {J. M.} and Yeh, {Y. C.}",

year = "2012",

month = dec,

doi = "10.1049/iet-ifs.2012.0200",

language = "English",

volume = "6",

pages = "318--323",

journal = "IET Information Security",

issn = "1751-8709",

publisher = "Institution of Engineering and Technology",

number = "4",

}

TY - JOUR

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

AU - Chiou, C. W.

AU - Chuang, T. P.

AU - Lin, S. S.

AU - Lee, C. Y.

AU - Lin, J. M.

AU - Yeh, Y. C.

PY - 2012/12

Y1 - 2012/12

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

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

UR - http://www.scopus.com/inward/record.url?scp=84878362224&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84878362224&partnerID=8YFLogxK

U2 - 10.1049/iet-ifs.2012.0200

DO - 10.1049/iet-ifs.2012.0200

M3 - Article

AN - SCOPUS:84878362224

SN - 1751-8709

VL - 6

SP - 318

EP - 323

JO - IET Information Security

JF - IET Information Security

IS - 4

ER -

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

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this