Multi-Segment GF(2m) Multiplication and its Application to Elliptic Curve Cryptography

被引：0

作者：

Lee, Dong-Ho ^{[1
]}

Oh, Jong-Soo ^{[1
]}

机构：

[1] Kyungpook Natl Univ, Sch Elect Engn & Comp Sci, Taegu 702701, South Korea

来源：

GLSVLSI'07: PROCEEDINGS OF THE 2007 ACM GREAT LAKES SYMPOSIUM ON VLSI | 2007年

关键词：

Elliptic Curve Cryptography (ECC); Coprocessor; Elliptic Curve Scalar Multiplication; Finite Field Multiplication; FPGA;

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

Scalar multiplication is the most time consuming computation in elliptic curve cryptography (ECC). ECC coprocessors provide computational support for the scalar multiplication algorithm. In this paper, we propose an efficient multi-segment GF(2(m)) multiplication method and discuss its application for ECC. The proposed method is particularly effective when the underlying technology provides an efficient realization of dual-port RAM block structures. We implemented ECC coprocessors in FPGA development environments to compare the resource usages of the ECC processors which use the proposed multi-segment multipliers and others using the digit-serial multipliers, The experimental results show that the proposed multi-segment multiplication method requires significantly less FPGA resources for the same multiplication performance in ECC implementations.

引用

页码：546 / 551

页数：6

共 50 条

[1] Concurrent error detection in GF(2m) multiplication and its application in elliptic curve cryptography
Chelton, W.
Benaissa, M.
[J]. IET CIRCUITS DEVICES & SYSTEMS, 2008, 2 (03) : 289 - 297
[2] GPU Accelerated Elliptic Curve Cryptography in GF(2m)
Cohen, Aaron E.
Parhi, Keshab K.
[J]. 53RD IEEE INTERNATIONAL MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, 2010, : 57 - 60
[3] GF(2m) arithmetic modules for elliptic curve cryptography
Morales-Sandoval, Miguel
Feregrino-Uribe, Claudia
[J]. RECONFIG 2006: PROCEEDINGS OF THE 2006 IEEE INTERNATIONAL CONFERENCE ON RECONFIGURABLE COMPUTING AND FPGA'S, 2006, : 176 - +
[4] Efficient linear array for multiplication in GF(2m) using a normal basis for elliptic curve cryptography
Kwon, S
Gaj, K
Kim, CH
Hong, CP
[J]. CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2004, PROCEEDINGS, 2004, 3156 : 76 - 91
[5] Design of flexible GF(2m) elliptic curve cryptography processors
Benaissa, Mohammed
Lim, Wei Ming
[J]. IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2006, 14 (06) : 659 - 662
[6] Flexible hardware reduction for elliptic curve cryptography in GF(2m)
Peter, Steffen
Langendoerfer, Peter
Piotrowski, Krzysztof
[J]. 2007 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION, VOLS 1-3, 2007, : 1259 - 1264
[7] New architecture for multiplication in GF(2m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography
Kwon, Soonhak
Kwon, Taekyoung
Park, Young-Ho
[J]. INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2005, 2006, 3935 : 335 - 351
[8] Fully parameterizable elliptic curve cryptography processor over GF(2m)
Kerins, T
Popovici, E
Marnane, W
Fitzpatrick, P
[J]. FIELD-PROGRAMMABLE LOGIC AND APPLICATIONS, PROCEEDINGS: RECONFIGURABLE COMPUTING IS GOING MAINSTREAM, 2002, 2438 : 750 - 759
[9] An efficient divider architecture over GF(2m) for Elliptic Curve Cryptography
Lee, SW
Kim, JN
Jang, JS
[J]. ESA'04 & VLSI'04, PROCEEDINGS, 2004, : 569 - 572
[10] Elliptic curve cryptography over binary finite field GF(2m)
Department of Physics, Eastern Mediterranean University, via Mersin 10, Gazimagusa, North Cyprus, Turkey
[J]. Inf. Technol. J., 2006, 1 (204-229):

← 1 2 3 4 5 →