Multiplexer implementation of low-complexity polynomial basis multiplier in GF(2m) using all one polynomial

被引：4

作者：

Chiou, Che Wun ^{[1
]}

Lee, Chiou-Yng ^{[2
]}

Yeh, Yun-Chi ^{[3
]}

机构：

[1] Ching Yun Univ, Dept Comp Sci & Informat Engn, Chungli 320, Taiwan

[2] Lunghwa Univ Sci & Technol, Dept Comp Informat & Network Engn, Tao Yuan 333, Taiwan

[3] Ching Yun Univ, Dept Elect Engn, Jhongli 320, Taiwan

来源：

INFORMATION PROCESSING LETTERS | 2011年 / 111卷 / 21-22期

关键词：

Multiplier; Cryptography; Multiplexer; Finite field; Polynomial basis; FINITE-FIELD MULTIPLIER; PARALLEL MULTIPLIERS; CONSTRUCTION;

D O I：

10.1016/j.ipl.2011.08.004

中图分类号：

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

学科分类号：

0812 ;

摘要：

Polynomial basis multipliers are realized by conventional AND and XOR gates. In this study, polynomial basis multiplier is implemented by multiplexers rather than traditional AND and XOR gates. Two bits are processed at the same time. The proposed multiplexer-based multiplier saves about 14% space complexity as compared to other existing multipliers. Furthermore, the proposed multiplier also saves about 37% time complexity (for example, m = 156) while comparing with other existing multipliers. (C) 2011 Elsevier B.V. All rights reserved.

引用

页码：1044 / 1047

页数：4

共 50 条

[1] Low Latency GF(2m) Polynomial Basis Multiplier
Luis Imana, Jose
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2011, 58 (05) : 935 - 946
[2] Low-complexity multiplexer-based normal basis multiplier over GF(2m)
Jenn-Shyong Horng
I-Chang Jou
Chiou-Yng Lee
Journal of Zhejiang University-SCIENCE A, 2009, 10 : 834 - 842
[3] Design and Implementation of a Polynomial Basis Multiplier Architecture Over GF(2m)
Ho, Huong
JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, 2014, 75 (03): : 203 - 208
[4] Design and Implementation of a Sequential Polynomial Basis Multiplier over GF(2m)
Mathe, Sudha Ellison
Boppana, Lakshmi
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2017, 11 (05): : 2680 - 2700
[5] Design and Implementation of a Polynomial Basis Multiplier Architecture Over GF(2m)
Huong Ho
Journal of Signal Processing Systems, 2014, 75 : 203 - 208
[6] Low-Complexity Multiplier for GF(2m) Based on All-One Polynomials
Xie, Jiafeng
Meher, Pramod Kumar
He, Jianjun
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2013, 21 (01) : 168 - 173
[7] Low-complexity dual basis digit serial GF(2m) multiplier
Department of Electrical Engineering, National Taiwan University of Science and Technology, 106 Taipei, Taiwan
不详
不详
ICIC Express Lett., 2009, 4 (1113-1118):
[8] Low-complexity Gaussian normal basis multiplier over GF(2m)
Chiou, C. W.
Chang, H. W.
Liang, W. -Y.
Lee, C. -Y.
Lin, J. -M.
Yeh, Y. -C.
IET INFORMATION SECURITY, 2012, 6 (04) : 310 - 317
[9] Low-complexity systolic multiplier over GF(2m) using weakly dual basis
Lee, CY
Lu, YC
Lu, EH
APCCAS 2002: ASIA-PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS, VOL 1, PROCEEDINGS, 2002, : 367 - 372
[10] Low-complexity multiplexer-based normal basis multiplier over GF(2~m)
Jenn-Shyong HORNG
I-Chang JOU
Chiou-Yng LEE
Journal of Zhejiang University(Science A:An International Applied Physics & Engineering Journal), 2009, 10 (06) : 834 - 842

← 1 2 3 4 5 →