Efficient Montgomery-Based Semi-Systolic Multiplier for Even-Type GNB of GF(2m)

被引：18

作者：

Wang, Zhen ^{[1
]}

Fan, Shuqin ^{[1
]}

机构：

[1] Zhengzhou Informat Sci & Technol Inst, Dept Appl Math, Zhengzhou 450002, Peoples R China

来源：

IEEE TRANSACTIONS ON COMPUTERS | 2012年 / 61卷 / 03期

基金：

国家高技术研究发展计划(863计划);

关键词：

Finite field multiplication; Gaussian normal basis; elliptic curve cryptosystem; montgomery; systolic architecture; LOW-COMPLEXITY; INVERSION;

D O I：

10.1109/TC.2010.272

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Efficient finite field multiplication is crucial for implementing public key cryptosystem. To achieve this, multipliers using Gaussian normal basis have been widely explored in previous works. In this paper, based on proposed Gaussian normal basis Montgomery (GNBM) representation, a semi-systolic even-type GNBM multiplier is developed. Analysis shows that the proposed architecture saves about 57 percent space complexity and 50 percent time complexity when compared with the only existing semi-systolic even-type GNB multiplier. Moreover, due to properties of regularity and modularity, the proposed multiplier is very suitable for VLSI implementation.

引用

页码：415 / 419

页数：5

共 23 条

[11] Novel Hybrid-Size Digit-Serial Systolic Multiplier over GF(2m) [J].

Hu, Zhenji ;

Xie, Jiafeng .

SYMMETRY-BASEL, 2018, 10 (11)

[12] Area-efficient low-latency polynomial basis finite field GF(2m) systolic multiplier for a class of trinomials [J].

Pillutla, Siva Ramakrishna ;

Boppana, Lakshmi .

MICROELECTRONICS JOURNAL, 2020, 97

[13] Efficient Parallel and Serial Systolic Structures for Multiplication and Squaring Over GF(2m) [J].

Ibrahim, Atef .

CANADIAN JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING-REVUE CANADIENNE DE GENIE ELECTRIQUE ET INFORMATIQUE, 2019, 42 (02) :114-120

[14] Efficient Bit-Parallel GF(2m) Multiplier for a Large Class of Irreducible Pentanomials [J].

Cilardo, Alessandro .

IEEE TRANSACTIONS ON COMPUTERS, 2009, 58 (07) :1001-1008

[15] Systolic and super-systolic multipliers for finite field GF(2m) based on irreducible trinomials [J].

Meher, Pramod Kumar .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2008, 55 (04) :1031-1040

[16] Palindromic-like representation for Gaussian normal basis multiplier over GF(2m) with odd type t [J].

Chiou, C. W. ;

Chuang, T. -P. ;

Lin, S. -S. ;

Lee, C. -Y. ;

Lin, J. -M. ;

Yeh, Y. -C. .

IET INFORMATION SECURITY, 2012, 6 (04) :318-323

[17] Low-Complexity Multiplier for GF(2m) Based on All-One Polynomials [J].

Xie, Jiafeng ;

Meher, Pramod Kumar ;

He, Jianjun .

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2013, 21 (01) :168-173

[18] Subquadratic Space Complexity Multiplier Using Even Type GNB Based on Efficient Toeplitz Matrix-Vector Product [J].

Park, Sun-Mi ;

Chang, Ku-Young ;

Hong, Dowon ;

Seo, Changho .

IEEE TRANSACTIONS ON COMPUTERS, 2018, 67 (12) :1794-1805

[19] Low latency systolic multipliers for finite field GF (2m) based on irreducible polynomials [J].

Jia-feng Xie ;

Jian-jun He ;

Wei-hua Gui .

Journal of Central South University, 2012, 19 :1283-1289

[20] Efficient FPGA Implementation of Low-Complexity Systolic Karatsuba Multiplier Over G F (2m) Based on NIST Polynomials [J].

Xie, Jiafeng ;

Meher, Pramod Kumar ;

Sun, Mingui ;

Li, Yuecheng ;

Zeng, Bo ;

Mao, Zhi-Hong .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2017, 64 (07) :1815-1825

← 1 2 3 →