GENERALIZED FAST ALGORITHM FOR COMPUTING MULTIPLICATIVE INVERSES IN GF(2M)

被引：11
|
作者：
ASANO, Y
ITOH, T
TSUJII, S
机构：
来源：
ELECTRONICS LETTERS | 1989年 / 25卷 / 10期
关键词：
D O I：
10.1049/el:19890449
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
引用
收藏
页码：664 / 665
页数：2
相关论文
共 50 条
  • [31] An Efficient Algorithm for Computing Modular Division over GF(2m) in Elliptic Curve Cryptography
    Lin, Siyuan
    He, Shan
    Guo, Xin
    Guo, Donghui
    PROCEEDINGS OF 2017 11TH IEEE INTERNATIONAL CONFERENCE ON ANTI-COUNTERFEITING, SECURITY, AND IDENTIFICATION (ASID), 2017, : 179 - 182
  • [32] Fast lookup table algorithm for finding roots of quadric or cubic polynomials in the GF(2m)
    Zhao, Zhiyu
    Wu, Fei
    Yu, Shengsheng
    Zhou, Jingli
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2005, 33 (02): : 70 - 72
  • [33] A basis-independent algorithm to design fast parallel multipliers over GF(2m)
    Elia, M
    Leone, M
    ITCC 2004: INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: CODING AND COMPUTING, VOL 2, PROCEEDINGS, 2004, : 553 - 559
  • [34] A compact and fast division architecture for a finite field GF(2m)
    Kim, CH
    Kwon, S
    Kim, JJ
    Hong, CP
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2003, PT 1, PROCEEDINGS, 2003, 2667 : 855 - 864
  • [35] Efficient Combined Algorithm for Multiplication and Squaring for Fast Exponentiation over Finite Fields GF(2m)
    Kim, Kee-Won
    Lee, Hyun-Ho
    Kim, Seung-Hoon
    PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON EMERGING DATABASES: TECHNOLOGIES, APPLICATIONS, AND THEORY, 2018, 461 : 50 - 57
  • [36] Fast exponentiaion over GF(2m) based on cellular automata
    Ku, KM
    Ha, KJ
    Yoo, KY
    COMPUTATIONAL SCIENCE - ICCS 2003, PT II, PROCEEDINGS, 2003, 2658 : 841 - 850
  • [37] Fast Hardware Algorithm for Division in GF(2m) Based on the Extended Euclid's Algorithm With Parallelization of Modular Reductions
    Kobayashi, Katsuki
    Takagi, Naofumi
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2009, 56 (08) : 644 - 648
  • [38] On the inherent space complexity of fast parallel multipliers for GF(2m)
    Elia, M
    Leone, M
    IEEE TRANSACTIONS ON COMPUTERS, 2002, 51 (03) : 346 - 351
  • [39] Fast Parallel GF(2m) Polynomial Multiplication for All Degrees
    Cilardo, Alessandro
    IEEE TRANSACTIONS ON COMPUTERS, 2013, 62 (05) : 929 - 943
  • [40] Instruction set extensions for fast arithmetic in finite fields GF(p) and GF(2m)
    Grossschädl, J
    Savas, E
    CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2004, PROCEEDINGS, 2004, 3156 : 133 - 147
12345