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

被引：3

作者：

Chiou, C. W. ^{[1
]}

Chuang, T. -P. ^{[1
]}

Lin, S. -S. ^{[2
]}

Lee, C. -Y. ^{[3
]}

Lin, J. -M. ^{[4
]}

Yeh, Y. -C. ^{[5
]}

机构：

[1] Chien Hsin Univ Sci & Technol, Dept Comp Sci & Informat Engn, Jhongli 320, Taiwan

[2] Natl Taiwan Normal Univ, Dept Comp Sci & Informat Engn, Taipei 116, Taiwan

[3] Lunghwa Univ Sci & Technol, Dept Comp Informat & Network Engn, Taoyuan Cty 333, Taiwan

[4] Feng Chia Univ, Dept Informat Engn & Comp Sci, Taichung 407, Taiwan

[5] Chien Hsin Univ Sci & Technol, Dept Elect Engn, Jhongli 320, Taiwan

来源：

IET INFORMATION SECURITY | 2012年 / 6卷 / 04期

关键词：

LOW-COMPLEXITY; SYSTOLIC ARCHITECTURES; POLYNOMIAL BASIS; DIVISION; INVERSION; BASES;

D O I：

10.1049/iet-ifs.2012.0200

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：318 / 323

页数：6

共 40 条

[1]

Agnew G. B., 1991, Journal of Cryptology, V3, P63, DOI 10.1007/BF00196789

[2]

Ahmed M. H., 2011, Proceedings of the 1st International Conference on Computer Networks and Information Technology (ICCNIT 2011), P75, DOI 10.1109/ICCNIT.2011.6020911

[3]

[Anonymous], 2000, IEEE 1363 2000

[4]

[Anonymous], FED INF PROC STAND P

[5] LOW COMPLEXITY NORMAL BASES [J].

ASH, DW ;

BLAKE, IF ;

VANSTONE, SA .

DISCRETE APPLIED MATHEMATICS, 1989, 25 (03) :191-210

[6] COMPUTATION WITH FINITE FIELDS [J].

BARTEE, TC ;

SCHNEIDER, DI .

INFORMATION AND CONTROL, 1963, 6 (02) :79-+

[7] Concurrent Error Detection in Finite-Field Arithmetic Operations Using Pipelined and Systolic Architectures [J].

Bayat-Sarmadi, Siavash ;

Hasan, M. Anwar .

IEEE TRANSACTIONS ON COMPUTERS, 2009, 58 (11) :1553-1567

[8] BIT-SERIAL REED-SOLOMON ENCODERS [J].

BERLEKAMP, ER .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1982, 28 (06) :869-874

[9]

Blake I.F., 1998, HPL98134

[10]

Chien-Hsing Wu, 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196), P33, DOI 10.1109/ISCAS.2001.922162

← 1 2 3 4 →