Energy-Efficient Implementations of GF(p) and GF(2m) Elliptic Curve Cryptography

被引:0
|
作者
Targhetta, Andrew D. [1 ,2 ]
Owen, Donald E., Jr. [2 ]
Israel, Francis L. [2 ]
Gratz, Paul V. [1 ]
机构
[1] Texas A&M Univ, Elect & Comp Engn, College Stn, TX USA
[2] Sandia Natl Labs, Albuquerque, NM 87185 USA
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
While public-key cryptography is essential for secure communications, the energy cost of even the most efficient algorithms based on Elliptic Curve Cryptography (ECC) is prohibitive on many ultra-low energy devices such as sensor-network nodes and identification tags. Although an abundance of hardware acceleration techniques for ECC have been proposed in literature, little research has focused on understanding the energy benefits of these techniques. Therefore, we evaluate the energy cost of ECC on several different hardware/software configurations across a range of security levels. Our work comprehensively explores implementations of both GF(p) and GF(2(m)) ECC, demonstrating that GF(2(m)) provides a 1.31 to 2.11 factor improvement in energy efficiency over GF(p) on an extended RISC processor. We also show that including a 4KB instruction cache in our system can reduce the energy cost of ECC by as much as 30%. Furthermore, our GF(2(m)) coprocessor achieves a 2.8 to 3.61 factor improvement in energy efficiency compared to instruction set extensions and significantly outperforms prior work.
引用
收藏
页码:704 / 711
页数:8
相关论文
共 50 条
  • [1] 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
  • [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] An efficient architecture for computing division over GF(2m) in elliptic curve cryptography
    Zhou, JY
    Jiang, XG
    Chen, HH
    [J]. 2005 6th International Conference on ASIC Proceedings, Books 1 and 2, 2005, : 274 - 277
  • [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] An Efficient Algorithm for Computing Modular Division over GF(2m) in Elliptic Curve Cryptography
    Lin, Siyuan
    He, Shan
    Guo, Xin
    Guo, Donghui
    [J]. PROCEEDINGS OF 2017 11TH IEEE INTERNATIONAL CONFERENCE ON ANTI-COUNTERFEITING, SECURITY, AND IDENTIFICATION (ASID), 2017, : 179 - 182
  • [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] 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):
  • [10] Performance Analysis of Reversible Finite Field Arithmetic Architectures Over GF(p) and GF(2m) in Elliptic Curve Cryptography
    Saravanan, P.
    Kalpana, P.
    [J]. JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2015, 24 (08)