An Efficient Algorithm for Computing Modular Division over GF(2m) in Elliptic Curve Cryptography

被引：0
|
作者：
Lin, Siyuan [1 ]
He, Shan [1 ]
Guo, Xin [1 ]
Guo, Donghui [1 ]
机构：
[1] Xiamen Univ, Dept Elect Engn, Xiamen 361005, Fujian, Peoples R China
来源：
PROCEEDINGS OF 2017 11TH IEEE INTERNATIONAL CONFERENCE ON ANTI-COUNTERFEITING, SECURITY, AND IDENTIFICATION (ASID) | 2017年
关键词：
Elliptic curve cryptography; Binary finite field; Modular division;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Modular inversion is the most complicated operation in elliptic curve cryptography(ECC). Based on the Extended Euclidean Algorithm(EEA), this paper presents a modified modular division algorithm in the binary finite field GF(2(m)). Furthermore, this paper designs a hardware implementation to verify the algorithm's performance with Verilog HDL, we also simulate it in GF(2(m)) to compare with other algorithms on clock cycles consumption.
引用
收藏
页码：179 / 182
页数：4
相关论文
共 50 条
  • [21] 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)
  • [22] DIVISION OVER GF(2M)
    FENN, STJ
    TAYLOR, D
    BENAISSA, M
    ELECTRONICS LETTERS, 1992, 28 (24) : 2259 - 2261
  • [23] High-speed Constant-time Division Module for Elliptic Curve Cryptography Based on GF(2m)
    Liao, Kai
    Cui, Xiaoxin
    Liao, Nan
    Wang, Tian
    Zhang, Xiao
    Huang, Ying
    Yu, Dunshan
    2014 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2014, : 818 - 821
  • [24] Instruction set extension for fast elliptic curve cryptography over binary finite fields GF(2m)
    Grosschädl, J
    Kamendje, GA
    IEEE INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES, AND PROCESSORS, PROCEEDINGS, 2003, : 455 - 468
  • [25] A combined multiplication/division algorithm for efficient design of ECC over GF(2m)
    Lin, Wen-Ching
    Chen, Jun-Hong
    Shieh, Ming-Der
    Wu, Chien-Ming
    TENCON 2007 - 2007 IEEE REGION 10 CONFERENCE, VOLS 1-3, 2007, : 974 - 977
  • [26] A simple architectural enhancement for fast and flexible elliptic curve cryptography over binary finite fields GF(2m)
    Tillich, S
    Grossschädl, J
    ADVANCES IN COMPUTER SYSTEMS ARCHITECTURE, PROCEEDINGS, 2004, 3189 : 282 - 295
  • [27] Fast Reconfigurable Elliptic Curve Cryptography Acceleration for GF(2m) on 32 bit Processors
    Aaron E. Cohen
    Keshab K. Parhi
    Journal of Signal Processing Systems, 2010, 60 : 31 - 45
  • [28] Multi-Segment GF(2m) Multiplication and its Application to Elliptic Curve Cryptography
    Lee, Dong-Ho
    Oh, Jong-Soo
    GLSVLSI'07: PROCEEDINGS OF THE 2007 ACM GREAT LAKES SYMPOSIUM ON VLSI, 2007, : 546 - 551
  • [29] Concurrent error detection in GF(2m) multiplication and its application in elliptic curve cryptography
    Chelton, W.
    Benaissa, M.
    IET CIRCUITS DEVICES & SYSTEMS, 2008, 2 (03) : 289 - 297
  • [30] Highly efficient architecture of elliptic curve scalar multiplication with fault tolerance over GF(2m)
    Zhou, Fang
    Fei, Caixian
    Wu, Ning
    Ge, Fen
    IEICE ELECTRONICS EXPRESS, 2021, 18 (11):
12345