An efficient divider architecture over GF(2m) for Elliptic Curve Cryptography

被引：0

作者：

Lee, SW ^{[1
]}

Kim, JN ^{[1
]}

Jang, JS ^{[1
]}

机构：

[1] Elect & Telecommun Res Inst, Network Secur Res Grp, Informat Secur Res Div, Taejon, South Korea

来源：

ESA'04 & VLSI'04, PROCEEDINGS | 2004年

关键词：

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

This paper presents an efficient divider architecture over GF(2m) for Elliptic Curve Cryptography(ECC). ECC has shorter key lengths compared with RSA, but point operations of elliptic curves are still time-consuming on restricted environments with limited computational power and small memory such as smart cards. Especially field division is the most time-consuming operation in GF(2m). We propose a new VLSI algorithm of division over GF(2m) and its hardware architecture. Our division algorithm is faster than the classical division because it does not need the succeeding multiplication. Our divider has about 8,900 gates and performs the division in 24mus, operating at 20MHz.

引用

页码：569 / 572

页数：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 Multiplier/Divider Design for Elliptic Curve Cryptosystem over GF(2m)
Shieh, Ming-Der
Chen, Jun-Hong
Lin, Wen-Ching
Wu, Chien-Ming
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2009, 25 (05) : 1555 - 1573
[3] An Efficient Algorithm for Computing Modular Division over GF(2m) in Elliptic Curve Cryptography
Lin, Siyuan
He, Shan
Guo, Xin
Guo, Donghui
PROCEEDINGS OF 2017 11TH IEEE INTERNATIONAL CONFERENCE ON ANTI-COUNTERFEITING, SECURITY, AND IDENTIFICATION (ASID), 2017, : 179 - 182
[4] 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
[5] 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):
[6] 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
[7] 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
[8] 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 - +
[9] 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
[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 →