An Efficient Algorithm for Computing Modular Division over GF(2m) in Elliptic Curve Cryptography

被引：0

作者：

Lin, Siyuan ^{[1
]}

He, Shan ^{[1
]}

Guo, Xin ^{[1
]}

Guo, Donghui ^{[1
]}

机构：

[1] Xiamen Univ, Dept Elect Engn, Xiamen 361005, Fujian, Peoples R China

来源：

PROCEEDINGS OF 2017 11TH IEEE INTERNATIONAL CONFERENCE ON ANTI-COUNTERFEITING, SECURITY, AND IDENTIFICATION (ASID) | 2017年

关键词：

Elliptic curve cryptography; Binary finite field; Modular division;

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

Modular inversion is the most complicated operation in elliptic curve cryptography(ECC). Based on the Extended Euclidean Algorithm(EEA), this paper presents a modified modular division algorithm in the binary finite field GF(2(m)). Furthermore, this paper designs a hardware implementation to verify the algorithm's performance with Verilog HDL, we also simulate it in GF(2(m)) to compare with other algorithms on clock cycles consumption.

引用

页码：179 / 182

页数：4

共 50 条

[1] An efficient architecture for computing division over GF(2m) in elliptic curve cryptography
Zhou, JY
Jiang, XG
Chen, HH
2005 6th International Conference on ASIC Proceedings, Books 1 and 2, 2005, : 274 - 277
[2] An efficient divider architecture over GF(2m) for Elliptic Curve Cryptography
Lee, SW
Kim, JN
Jang, JS
ESA'04 & VLSI'04, PROCEEDINGS, 2004, : 569 - 572
[3] 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
[4] 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):
[5] Energy-Efficient Implementations of GF(p) and GF(2m) Elliptic Curve Cryptography
Targhetta, Andrew D.
Owen, Donald E., Jr.
Israel, Francis L.
Gratz, Paul V.
2015 33RD IEEE INTERNATIONAL CONFERENCE ON COMPUTER DESIGN (ICCD), 2015, : 704 - 711
[6] GPU Accelerated Elliptic Curve Cryptography in GF(2m)
Cohen, Aaron E.
Parhi, Keshab K.
53RD IEEE INTERNATIONAL MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, 2010, : 57 - 60
[7] 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 - +
[8] 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
[9] Division algorithm over GF(2m)
Popovici, EM
Fitzpatrick, P
ELECTRONICS LETTERS, 1998, 34 (19) : 1843 - 1844
[10] Design of flexible GF(2m) elliptic curve cryptography processors
Benaissa, Mohammed
Lim, Wei Ming
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2006, 14 (06) : 659 - 662

← 1 2 3 4 5 →