Cost-Effective Implementations of GF (p) Elliptic Curve Cryptography Computations

被引：0

作者：

Khali, Hakim ^{[1
]}

Farah, Ahcene ^{[1
]}

机构：

[1] Ajman Univ Sci & Technol, Fac Comp Sci & Comp Engn, POB 346, Ajman, U Arab Emirates

来源：

INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY | 2007年 / 7卷 / 08期

关键词：

ECC; projective forms; modulo multipliers;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This research paper aims at analyzing the impact of exploiting the parallelism available in two common Elliptic Curve Cryptography (ECC) projective forms on speed and cost factors, assuming point-multiplication is implemented using the m-ary algorithm instead of the popular binary algorithm. Point-multiplication is implemented using scalable multipliers in order to replicate the design for varying-size security keys. Simulation results are shown for each projective form and a cross comparison is also performed as well.

引用

页码：29 / 37

页数：9

共 50 条

[31] A low-power and low-energy flexible GF(p) elliptic-curve cryptography processor
Ahmadi, Hamid Reza
Afzali-Kusha, Ali
JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE C-COMPUTERS & ELECTRONICS, 2010, 11 (09): : 724 - 736
[32] A low-power and low-energy flexible GF(p) elliptic-curve cryptography processor
Hamid Reza AHMADI
Ali AFZALI-KUSHA
Frontiers of Information Technology & Electronic Engineering, 2010, (09) : 724 - 736
[33] Elliptic Curve Cryptography with Efficiently Computable Endomorphisms and Its Hardware Implementations for the Internet of Things
Liu, Zhe
Grossschadl, Johann
Hu, Zhi
Jarvinen, Kimmo
Wang, Husen
Verbauwhede, Ingrid
IEEE TRANSACTIONS ON COMPUTERS, 2017, 66 (05) : 773 - 785
[34] A Systematic Review of Fast, Scalable, and Efficient Hardware Implementations of Elliptic Curve Cryptography for Blockchain
Ifrim, Rares
Loghin, Dumitrel
Popescu, Decebal
ACM TRANSACTIONS ON RECONFIGURABLE TECHNOLOGY AND SYSTEMS, 2024, 17 (04)
[35] 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
[36] 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
[37] Low Complexity Montgomery Multiplication Architecture for Elliptic Curve Cryptography over GF(pm)
Talapatra, Somsubhra
Rahaman, Hafizur
PROCEEDINGS OF THE 2010 18TH IEEE/IFIP INTERNATIONAL CONFERENCE ON VLSI AND SYSTEM-ON-CHIP, 2010, : 219 - 224
[38] 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):
[39] Safe and Effective Elliptic Curve Cryptography Algorithm against Energy Attack
Yao, Jianbo
Yang, Chaoqiong
Zhang, Tao
2022 IEEE INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING, BIG DATA AND ALGORITHMS (EEBDA), 2022, : 1313 - 1316
[40] Low-cost elliptic curve cryptography for wireless sensor networks
Batina, Lejla
Mentens, Nele
Sakiyama, Kazuo
Preneel, Bart
Verbauwhede, Ingrid
SECURITY AND PRIVACY IN AD-HOC AND SENSOR NETWORKS, 2006, 4357 : 6 - +

← 1 2 3 4 5 →