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 条
  • [41] An reconfigurable multiplier in GF(2m) for elliptic curve cryptosystem
    Kitsos, P
    Theodoridis, G
    Koufopavlou, O
    ICECS 2003: PROCEEDINGS OF THE 2003 10TH IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS AND SYSTEMS, VOLS 1-3, 2003, : 699 - 702
  • [42] High-Speed Algorithm for Modular Exponentiation over GF(2m)
    He Debiao
    Chen Jianhua
    Hu Zhijin
    PROCEEDINGS OF 2009 INTERNATIONAL WORKSHOP ON INFORMATION SECURITY AND APPLICATION, 2009, : 248 - 251
  • [43] Efficient multiplication in GF(pk) for elliptic curve cryptography
    Bajard, JC
    Imbert, L
    Nègre, C
    Plantard, T
    16TH IEEE SYMPOSIUM ON COMPUTER ARITHMETIC, PROCEEDINGS, 2003, : 181 - 187
  • [44] Effects of instruction-set extensions on an embedded processor:: A case study on elliptic-curve cryptography over GF(2m)
    Bartolini, Sandro
    Branovic, Irina
    Giorgi, Roberto
    Martinelli, Enrico
    IEEE TRANSACTIONS ON COMPUTERS, 2008, 57 (05) : 672 - 685
  • [45] An efficient algorithm for computing inverses in GF(2m) using dual bases
    Yoo, HS
    Yoon, SU
    Kim, ES
    COMPUTATIONAL SCIENCE - ICCS 2003, PT IV, PROCEEDINGS, 2003, 2660 : 994 - 999
  • [46] New architecture for multiplication in GF(2m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography
    Kwon, Soonhak
    Kwon, Taekyoung
    Park, Young-Ho
    INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2005, 2006, 3935 : 335 - 351
  • [47] An area/performance trade-off analysis of a GF(2m) multiplier architecture for elliptic curve cryptography
    Morales-Sandoval, Miguel
    Feregrino-Uribe, Claudia
    Cumplido, Rene
    Algredo-Badillo, Ignacio
    COMPUTERS & ELECTRICAL ENGINEERING, 2009, 35 (01) : 54 - 58
  • [48] A Flexible Approach to Generating Customized Elliptic Curve Cryptographic Coprocessors over GF(2m)
    Zhao, Hui
    Bai, Guoqiang
    Chen, Hongyi
    2008 9TH INTERNATIONAL CONFERENCE ON SOLID-STATE AND INTEGRATED-CIRCUIT TECHNOLOGY, VOLS 1-4, 2008, : 2132 - 2135
  • [49] Research of high performance architecture for elliptic curve scalar multiplication over GF(2m)
    Dan, Yongping
    Zou, Xuecheng
    Liu, Zhenglin
    Han, Yu
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2008, 36 (11): : 48 - 51
  • [50] Efficient systolic modular multiplier/squarer for fast exponentiation over GF(2m)
    Choi, Se-Hyu
    Lee, Keon-Jik
    IEICE ELECTRONICS EXPRESS, 2015, 12 (11):
12345