Accelerating elliptic curve scalar multiplication over GF(2m) on graphic hardwares

被引：7

作者：

Seo, Seog Chung ^{[1
]}

Kim, Taehong ^{[2
]}

Hong, Seokhie ^{[3
]}

机构：

[1] ETRI, Attached Inst, Taejon, South Korea

[2] ETRI, Taejon, South Korea

[3] Korea Univ, CIST, Seoul, South Korea

来源：

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 2015年 / 75卷

关键词：

Graphic Processing Units (GPUs); Elliptic Curve Cryptosystem (ECC); Parallel cryptographic computation; CUDA;

D O I：

10.1016/j.jpdc.2014.09.001

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper, we present PEG (Parallel ECC library on GPU), which is efficient implementation of Elliptic Curve Scalar Multiplication over GF (2(m)) on Graphic Processing Units. While existing ECC implementations over GPU focused on limited parameterizations such as (fixed scalar and different curves) or (different scalars and same base point), PEG covers all parameter options ((a) fixed scalar and variable points, (b) random scalars and fixed input point, and (c) random scalars and variable points) which are used for ECC-based protocols such as ECDH, ECDSA and ECIES. With GPU optimization concerns and through analyzing parameter types used for ECC-based protocols, we investigate promising algorithms at both finite field arithmetic and scalar multiplication level for performance optimization according to each parameterization. PEG covers ECC implementations over GF(2(163)), GF(2(233)) and GF(2(283)) for 80-bit, 112-bit and 128-bit security on GTX285 and GTX480. PEG can achieve remarkable performance compared with MIRACL, one of the most famous ECC library, running on Intel i7 CPU (2.67 GHz). (C) 2014 Elsevier Inc. All rights reserved.

引用

页码：152 / 167

页数：16

共 50 条

[21] 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
[22] 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
[23] Collision search for Elliptic Curve Discrete Logarithm over GF(2m) with FPGA
de Dormale, Guerric Meurice
Bulens, Philippe
Quisquater, Jean-Jacques
CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2007, PROCEEDINGS, 2007, 4727 : 378 - +
[24] 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
[25] New hardware architecture for multiplication over GF(2m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography
Kwon, Soonhak
Kwnon, Taekyoung
Park, Young-Ho
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2008, E91A (01) : 236 - 243
[26] An reconfigurable multiplier in GF(2m) for elliptic curve cryptosystem
Kitsos, P
Theodoridis, G
Koufopavlou, O
ICECS 2003: PROCEEDINGS OF THE 2003 10TH IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS AND SYSTEMS, VOLS 1-3, 2003, : 699 - 702
[27] 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 - +
[28] 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
[29] Efficient linear array for multiplication in GF(2m) using a normal basis for elliptic curve cryptography
Kwon, S
Gaj, K
Kim, CH
Hong, CP
CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2004, PROCEEDINGS, 2004, 3156 : 76 - 91
[30] Efficient Implementation of Scalar Multiplication for ECC in GF (2m) on FPGA
Shylashree, N.
Sridhar, V.
2015 INTERNATIONAL CONFERENCE ON EMERGING RESEARCH IN ELECTRONICS, COMPUTER SCIENCE AND TECHNOLOGY (ICERECT), 2015, : 476 - U480

← 1 2 3 4 5 →