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

資訊工程學系

研究成果: 雜誌貢獻 › 文章 › 同行評審

5 引文斯高帕斯（Scopus）

摘要

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	https://doi.org/10.1049/iet-ifs.2012.0200
出版狀態	已發佈 - 2012 十二月 1

ASJC Scopus subject areas

Software
Information Systems
Computer Networks and Communications

存取文件

10.1049/iet-ifs.2012.0200

引用此

@article{f6902a2c08c841b4b28ce62fbd9f2412,

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,

day = "1",

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/1

Y1 - 2012/12/1

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

VL - 6

SP - 318

EP - 323

JO - IET Information Security

JF - IET Information Security

SN - 1751-8709

IS - 4

ER -