Fully paramaterisable Galois field arithmetic processor over GF(3m) suitable for elliptic curve cryptography

被引：0

作者：

Kerins, T ^{[1
]}

Popovici, EM ^{[1
]}

Marnane, WP ^{[1
]}

机构：

[1] Univ Coll Cork, Dept Elect & Elect Engn, Cork, Ireland

来源：

2004 24TH INTERNATIONAL CONFERENCE ON MICROELECTRONICS, PROCEEDINGS, VOLS 1 AND 2 | 2004年

关键词：

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

In this paper we present an architecture for a flexible GF(3(m)) multiplicative arithmetic processor. The ABC processor performs computations of the form R = (AB/C) mod F in 2m clock cycles, where A,B,C and F are polynomials over GF(3). The same hardware can be used for different field sizes offering full paramaterisability up to a maximum field size. We present prototype implementation results on FPGA for a field size of GF(3(255)). The processor is suitable for cryptographic applications where variable levels of security are required.

引用

页码：739 / 742

页数：4

共 46 条

[1] Fully parameterizable elliptic curve cryptography processor over GF(2m)
Kerins, T
Popovici, E
Marnane, W
Fitzpatrick, P
FIELD-PROGRAMMABLE LOGIC AND APPLICATIONS, PROCEEDINGS: RECONFIGURABLE COMPUTING IS GOING MAINSTREAM, 2002, 2438 : 750 - 759
[2] Fast arithmetic operations of elliptic curve over GF(3m)
Institute of Communications Engineering, PLA Univ. of Sci. and Tech., Nanjing 210007, China
不详
Jiefangjun Ligong Daxue Xuebao, 1600, 1 (1-6):
[3] A compact finite field processor over GF(2m) for elliptic curve cryptography
Kim, JH
Lee, DH
2002 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL II, PROCEEDINGS, 2002, : 340 - 343
[4] A Low-Power Parallel Architecture for Finite Galois Field GF(2(m)) Arithmetic Operations for Elliptic Curve Cryptography
Amini, Esmaeil
Jeddi, Zahra
Khattab, Ahmed
Bayoumi, Magdy
JOURNAL OF LOW POWER ELECTRONICS, 2012, 8 (04) : 440 - 451
[5] GF(2m) arithmetic modules for elliptic curve cryptography
Morales-Sandoval, Miguel
Feregrino-Uribe, Claudia
RECONFIG 2006: PROCEEDINGS OF THE 2006 IEEE INTERNATIONAL CONFERENCE ON RECONFIGURABLE COMPUTING AND FPGA'S, 2006, : 176 - +
[6] Performance Analysis of Reversible Finite Field Arithmetic Architectures Over GF(p) and GF(2m) in Elliptic Curve Cryptography
Saravanan, P.
Kalpana, P.
JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2015, 24 (08)
[7] Elliptic curve cryptography over binary finite field GF(2m)
Department of Physics, Eastern Mediterranean University, via Mersin 10, Gazimagusa, North Cyprus, Turkey
Inf. Technol. J., 2006, 1 (204-229):
[8] A study on constructing the arithmetic unit over GF(3m)
Park, Chun-Myoung
Kim, Chee-Yong
TENCON 2005 - 2005 IEEE REGION 10 CONFERENCE, VOLS 1-5, 2006, : 1097 - 1100
[9] High-performance hardware architecture of elliptic curve cryptography processor over GF(2163)
Dan, Yong-ping
Zou, Xue-cheng
Liu, Zheng-lin
Han, Yu
Yi, Li-hua
JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE A, 2009, 10 (02): : 301 - 310
[10] High-performance hardware architecture of elliptic curve cryptography processor over GF(2163)
Yong-ping DAN
Journal of Zhejiang University(Science A:An International Applied Physics & Engineering Journal), 2009, 10 (02) : 301 - 310

← 1 2 3 4 5 →