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 条

[21] Parallel memory architecture for elliptic curve cryptography over GF(p) aimed at efficient FPGA implementation
Laue, Ralf
Huss, Sorin A.
JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, 2008, 51 (01): : 39 - 55
[22] An elliptic curve cryptography coprocessor over GF(2m) on a low-cost embedded system
Zhao, Hui
Wang, Long
Bai, Guo-Qiang
2007 INTERNATIONAL WORKSHOP ON ELECTRON DEVICES AND SEMICONDUCTOR TECHNOLOGY, 2007, : 178 - +
[23] A Flexible Soft IP Core for Standard Implementations of Elliptic Curve Cryptography in Hardware
Ferreira, Bruno F.
Calazans, Ney L. V.
2013 IEEE 20TH INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS, AND SYSTEMS (ICECS), 2013, : 577 - 580
[24] COST-EFFECTIVE STATION IMPLEMENTATIONS IN MININET.
Faldella, E.
Neri, G.
Salomon, T.
EUROMICRO Journal (European Association for Microprocessing and Microprogramming), 1979, 5 (05): : 285 - 294
[25] FPGA implementations of elliptic curve cryptography and Tate pairing over a binary field
Li, Hao
Huang, Jian
Sweany, Philip
Huang, Dijiang
JOURNAL OF SYSTEMS ARCHITECTURE, 2008, 54 (12) : 1077 - 1088
[26] Performance Analysis of Reversible Finite Field Arithmetic Architectures Over GF(p) and GF(2m) in Elliptic Curve Cryptography
Saravanan, P.
Kalpana, P.
JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2015, 24 (08)
[27] 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
[28] Flexible hardware reduction for elliptic curve cryptography in GF(2m)
Peter, Steffen
Langendoerfer, Peter
Piotrowski, Krzysztof
2007 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION, VOLS 1-3, 2007, : 1259 - 1264
[29] A High Performance FPGA Implementation of 256-bit Elliptic Curve Cryptography Processor Over GF(p)
Feng, Xiang
Li, Shuguo
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2015, E98A (03) : 863 - 869
[30] A low-power and low-energy flexible GF(p) elliptic-curve cryptography processor
Hamid Reza Ahmadi
Ali Afzali-Kusha
Journal of Zhejiang University SCIENCE C, 2010, 11 : 724 - 736

← 1 2 3 4 5 →