A Fast and Efficient 191-bit Elliptic Curve Cryptographic Processor Using a Hybrid Karatsuba Multiplier for IoT Applications

被引:0
|
作者
Singh Dhanda, Sumit [1 ]
Singh, Brahmjit [2 ]
Lin, Chia-Chen [3 ]
Jindal, Poonam [2 ]
Panwar, Deepak [4 ]
Kumar Sharma, Tarun [5 ]
Agarwal, Saurabh [6 ]
Pak, Wooguil [6 ]
机构
[1] IILM Univ, Dept Comp Sci & Engn, Greater Noida 201306, Uttar Pradesh, India
[2] Natl Inst Technol, Dept ECE, Kurukshetra 136119, Haryana, India
[3] Natl Chin Yi Univ Technol, Dept Comp Sci & Informat Engn, Taichung 411, Taiwan
[4] Manipal Univ Jaipur, Dept CSE, Jaipur 303007, India
[5] Shobhit Univ Gangoh, Dept Comp Sci & Engn, Saharanpur 247341, Uttar Pradesh, India
[6] Yeungnam Univ, Dept Informat & Commun Engn, Gyongsan 38541, South Korea
来源
IEEE ACCESS | 2024年 / 12卷
关键词
Elliptic curve cryptography; Security; Internet of Things; Galois fields; Field programmable gate arrays; Encryption; Pipeline processing; Jacobian matrices; Hardware; Elliptic curves; Information security; Elliptic curve cryptography (ECC); field programmable gate arrays (FPGA); information security; Internet of Things (IoT); Karatsuba multiplier; POINT-MULTIPLICATION; FPGA IMPLEMENTATION; ARCHITECTURE; SECURITY; DESIGN;
D O I
10.1109/ACCESS.2024.3472650
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The most widely used asymmetric cipher is ECC. It can be applied to IoT applications to offer various security services. However, a wide range of sectors have been investigated for applying ECC. The field of elliptic curve cryptographic processors for GF (2191) has received less attention. This study presents a low-resource, high-efficiency architecture for a 191-bit ECC processor. This design uses a novel hybrid Karatsuba multiplier for the multiplication of finite fields. For GF (2191), the Quad-Itoh-Tsuji algorithm has been altered to provide a small-size inversion unit. PlanAhead software synthesizes the CPU, which is then implemented on several Xilinx FPGAs. With savings in slice consumption ranging from 16 to 43 percent, the implemented design is the most restricted compared to the current designs. Compared to previously published designs, it is 3.8-1000 times faster. The elliptic curve scalar multiplication on the Virtex-7 FPGA is computed in 7.24 mu s. Additionally, the proposed design achieves savings in area-time products of 77 to 90 percent. It may be beneficial for IoT edge devices. It utilizes 3120 mW of power for the operation. A state-of-the-art comparison based on the figure of merit (FoM) reveals that the proposed design outclasses the newest designs by a large margin. It also exhibits a throughput of 138.121 Kbps.
引用
收藏
页码:144304 / 144315
页数:12
相关论文
共 4 条
  • [1] Area-Efficient Realization of Binary Elliptic Curve Point Multiplication Processor for Cryptographic Applications
    Aljaedi, Amer
    Jamal, Sajjad Shaukat
    Rashid, Muhammad
    Alharbi, Adel R.
    Alotaibi, Mohammed
    Alanazi, Dalal J.
    APPLIED SCIENCES-BASEL, 2023, 13 (12):
  • [2] A 193-bit encryption processor for elliptic curve cryptosystem using fast VLSI algorithms in finite fields
    Moon, S
    CCNC: 2005 2ND IEEE CONSUMER COMMUNICATIONS AND NETWORKING CONFERENCE, 2005, : 611 - 613
  • [3] Fast elliptic curve cryptographic processor architecture based on three parallel Gf(2k) bit level pipelined digit serial multipliers
    Gutub, AAA
    ICECS 2003: PROCEEDINGS OF THE 2003 10TH IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS AND SYSTEMS, VOLS 1-3, 2003, : 72 - 75
  • [4] Efficient Power-Analysis-Resistant Dual-Field Elliptic Curve Cryptographic Processor Using Heterogeneous Dual-Processing-Element Architecture
    Lee, Jen-Wei
    Chung, Szu-Chi
    Chang, Hsie-Chia
    Lee, Chen-Yi
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2014, 22 (01) : 49 - 61