A Fully Pipelined High-Performance Elliptic Curve Cryptography Processor for NIST P-256

被引:0
|
作者
Yan, Han [1 ,2 ]
Chen, Shuai [3 ]
Huang, Junying [1 ,2 ]
Ye, Jing [1 ,2 ,4 ]
Li, Huawei [1 ,2 ,4 ]
Li, Xiaowei [1 ,2 ]
机构
[1] Chinese Acad Sci, Inst Comp Technol, State Key Lab Processors, Beijing, Peoples R China
[2] Univ Chinese Acad Sci, Beijing, Peoples R China
[3] Binary Semicond Co Ltd, Rock Solid Secur Lab, Suzhou, Peoples R China
[4] CASTEST Co Ltd, Beijing, Peoples R China
基金
中国国家自然科学基金;
关键词
Elliptic curve cryptography (ECC); elliptic curve point multiplication (ECPM); hardware implementation; AREA-EFFICIENT; MULTIPLICATION;
D O I
10.1109/ETS61313.2024.10567154
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Elliptic curve cryptography (ECC) is widely used in public key encryption, but its high-speed deployment faces challenges due to algorithmic and arithmetic complexity. In this paper, we present a high-performance ECC processor for the elliptic curve point multiplication (ECPM) of NIST P-256. Our approach employs a fully pipelined architecture featuring a 7-stage, 256-bit multiplier operating at a high frequency. To manage the data flow of the ECPM operation process, we devise a controller equipped with configurable instructions, which provides ECPM operations with higher flexibility to meet diverse contextual requirements. Additionally, we introduce a compact pipeline schedule to reduce ECPM computation clock cycles. The proposed LUT-based design achieves ECPM computation in 0.039 ms on FPGA (Virtex-7 platform) and 0.037 ms on ASIC (90nm technology), requiring only 10712 clock cycles.
引用
收藏
页数:4
相关论文
共 50 条
  • [31] A high-performance elliptic curve cryptographic processor for general curves over GF(p) based on a systolic arithmetic unit
    Chen, Gang
    Bai, Guoqiang
    Chen, Hongyi
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2007, 54 (05) : 412 - 416
  • [32] High-Performance Pipelined Architecture of Elliptic Curve Scalar Multiplication Over GF(2m)
    Li, Lijuan
    Li, Shuguo
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2016, 24 (04) : 1223 - 1232
  • [33] Low-Complexity Elliptic Curve Cryptography Processor Based on Configurable Partial Modular Reduction Over NIST Prime Fields
    Choi, Piljoo
    Lee, Mun-Kyu
    Kim, Ji-Hoon
    Kim, Dong Kyue
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2018, 65 (11) : 1703 - 1707
  • [34] High Performance SM2 Elliptic Curve Cryptographic Processor over GF(p)
    Hu, Xianghong
    Cai, Shuting
    Zhan, Ruidian
    Xiong, Xiaoming
    PROCEEDINGS OF THE 38TH CHINESE CONTROL CONFERENCE (CCC), 2019, : 8904 - 8908
  • [35] Optimized FPGA-based elliptic curve cryptography processor for high-speed applications
    Jarvinen, Kimmo
    INTEGRATION-THE VLSI JOURNAL, 2011, 44 (04) : 270 - 279
  • [36] Energy-Adaptive Dual-Field Processor for High-Performance Elliptic Curve Cryptographic Applications
    Lai, Jyu-Yuan
    Huang, Chih-Tsun
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2011, 19 (08) : 1512 - 1517
  • [37] High radix parallel architecture for GF(p) elliptic curve processor
    Gutub, AAA
    Ibrahim, MK
    2003 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOL II, PROCEEDINGS: SPEECH II; INDUSTRY TECHNOLOGY TRACKS; DESIGN & IMPLEMENTATION OF SIGNAL PROCESSING SYSTEMS; NEURAL NETWORKS FOR SIGNAL PROCESSING, 2003, : 625 - 628
  • [38] Fully paramaterisable Galois field arithmetic processor over GF(3m) suitable for elliptic curve cryptography
    Kerins, T
    Popovici, EM
    Marnane, WP
    2004 24TH INTERNATIONAL CONFERENCE ON MICROELECTRONICS, PROCEEDINGS, VOLS 1 AND 2, 2004, : 739 - 742
  • [39] High performance scalable elliptic curve cryptosystem processor for Koblitz curves
    Loi, K. C. Cinnati
    Ko, Seok-Bum
    MICROPROCESSORS AND MICROSYSTEMS, 2013, 37 (4-5) : 394 - 406
  • [40] A scalable and high performance elliptic curve processor with resistance to timing attacks
    Hodjat, A
    Hwang, DD
    Verbauwhede, I
    ITCC 2005: INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: CODING AND COMPUTING, VOL 1, 2005, : 538 - 543