Elixir: High-Throughput Cost-Effective Dual-Field Processors and the Design Framework for Elliptic Curve Cryptography

被引:35
作者
Lai, Jyu-Yuan [1 ]
Huang, Chih-Tsun [1 ]
机构
[1] Natl Tsing Hua Univ, Dept Comp Sci, Hsinchu, Taiwan
关键词
Coprocessors; elliptic curve cryptography; public-key cryptography; VLSI;
D O I
10.1109/TVLSI.2008.2001239
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We present a design framework that consists of a high-throughput, parallel, and scalable elliptic curve cryptographic (ECC) processor, and its cost-effectiveness methodology for the design exploration. A two-phase scheduling methodology is proposed to optimize the ECC arithmetic over both GF(p) and GF(2(m)). Based on the methodology, a parallel and scalable ECC architecture is also proposed. Our dual-field ECC architecture supports arbitrary elliptic curves and arbitrary finite fields with different field sizes. The optimization to a variety of applications with different area/throughput requirements can be achieved rapidly and efficiently. Using 0.13-mu m CMOS technology, a 160-bit ECC processor core is implemented, which can perform elliptic-curve scalar multiplication in 340 mu s over GF(p) and 155 mu s over GF(2(m)), respectively. The comparison of speed and area overhead among different ECC designs justifies the cost-effectiveness of the proposed ECC architecture with its design methodology.
引用
收藏
页码:1567 / 1580
页数:14
相关论文
共 25 条
  • [1] [Anonymous], P DAC
  • [2] [Anonymous], 2000, 1363 IEEE
  • [3] Bailey DV, 2001, J CRYPTOL, V14, P153, DOI 10.1007/s00145-001-0012
  • [4] Blake I.F., 1999, ELLIPTIC CURVES CRYP
  • [5] Customizable elliptic curve cryptosystems
    Cheung, RCC
    Telle, NJB
    Luk, W
    Cheung, PYK
    [J]. IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2005, 13 (09) : 1048 - 1059
  • [6] Low-cost Elliptic Curve Digital Signature coprocessor for smart cards
    de Dormale, Guerric Meurice
    Ambroise, Renaud
    Bol, David
    Quisquater, Jean-Jacques
    Legat, Jean-Didier
    [J]. IEEE 17TH INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES AND PROCESSORS, PROCEEDINGS, 2006, : 347 - +
  • [7] ERNST M, 2002, CRYPTOGRAPHIC HARDWA, P175
  • [8] Gura N, 2002, LECT NOTES COMPUT SC, V2523, P349
  • [9] KOBLITZ N, 1987, MATH COMPUT, V48, P203, DOI 10.1090/S0025-5718-1987-0866109-5
  • [10] Analyzing and comparing Montgomery multiplication algorithms
    Koc, CK
    Acar, T
    Kaliski, BS
    [J]. IEEE MICRO, 1996, 16 (03) : 26 - 33