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 条
  • [31] Implementation of elliptic curve cryptographic coprocessor over GF(2m) on an FPGA
    Okada, S
    Torii, N
    Itoh, K
    Takenaka, M
    CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS-CHES 2000, PROCEEDINGS, 2001, 1965 : 25 - 40
  • [32] Efficient hardware implementation of elliptic curve cryptography over GF(pm)
    Lee, MK
    Kim, KT
    Kim, H
    Kim, DK
    INFORMATION SECURITY APPLICATIONS, 2006, 3786 : 207 - 217
  • [33] New hardware architecture for multiplication over GF(2m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography
    Kwon, Soonhak
    Kwnon, Taekyoung
    Park, Young-Ho
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2008, E91A (01) : 236 - 243
  • [34] AN O(m2)-DEPTH QUANTUM ALGORITHM FOR THE ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEM OVER GF(2m)a
    Maslov, Dmitri
    Mathew, Jimson
    Cheung, Donny
    Pradhan, Dhiraj K.
    QUANTUM INFORMATION & COMPUTATION, 2009, 9 (7-8) : 610 - 621
  • [35] An O(m2)-depth quantum algorithm for the elliptic curve discrete logarithm problem over GF(2m)
    Maslov, Dmitri
    Mathew, Jimson
    Cheung, Donny
    Pradhan, Dhiraj K.
    Quantum Information and Computation, 2009, 9 (7-8): : 0610 - 0621
  • [36] Elliptic Curve Scalar Multiplication Algorithm Based on Side Channel Atomic Block over GF(2m)
    Liu, Shuang Gen
    Hu, Yan Yan
    Wei, Lan
    International Journal of Network Security, 2021, 23 (06) : 1005 - 1011
  • [37] A reconfigurable arithmetic logic unit for elliptic curve cryptosystems over GF(2m)
    Schmalisch, M
    Timmermann, D
    PROCEEDINGS OF THE 46TH IEEE INTERNATIONAL MIDWEST SYMPOSIUM ON CIRCUITS & SYSTEMS, VOLS 1-3, 2003, : 831 - 834
  • [38] Collision search for Elliptic Curve Discrete Logarithm over GF(2m) with FPGA
    de Dormale, Guerric Meurice
    Bulens, Philippe
    Quisquater, Jean-Jacques
    CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2007, PROCEEDINGS, 2007, 4727 : 378 - +
  • [39] Accelerating elliptic curve scalar multiplication over GF(2m) on graphic hardwares
    Seo, Seog Chung
    Kim, Taehong
    Hong, Seokhie
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2015, 75 : 152 - 167
  • [40] A fast parallel implementation of elliptic curve point multiplication over GF(2m)
    Rodríguez-Henríquez, F
    Saqib, NA
    Díaz-Pérez, A
    MICROPROCESSORS AND MICROSYSTEMS, 2004, 28 (5-6) : 329 - 339
12345