Fast implementation of elliptic curve arithmetic in GF(pn)

被引：0
|
作者：
Lim, CH [1 ]
Hwang, HS [1 ]
机构：
[1] Future Syst Inc, Informat & Commun Res Ctr, Seo Cho Gu, Seoul 137130, South Korea
来源：
PUBLIC KEY CRYTOGRAPHY | 2000年 / 1751卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Elliptic curve cryptosystems have attracted much attention in recent years and one of major interests in ECC is to develop fast algorithms for field/elliptic curve arithmetic. In this paper we present various improvement techniques for field arithmetic in GF(p(n))(p a prime), in particular, fast field multiplication and inversion algorithms, and provide our implementation results on Pentium II and Alpha 21164 microprocessors.
引用
收藏
页码：405 / 421
页数：17
相关论文
共 50 条
  • [1] Fast arithmetic operations of elliptic curve over GF(3m)
    Institute of Communications Engineering, PLA Univ. of Sci. and Tech., Nanjing 210007, China
    不详
    [J]. Jiefangjun Ligong Daxue Xuebao, 1600, 1 (1-6):
  • [2] AN IMPLEMENTATION OF FAST ALGORITHM FOR ELLIPTIC CURVE CRYPTOSYSTEM OVER GF(p)
    Lu Chen Chen Yanpu Bian ZhengzhongLife Science Institute Xian Jiaotong University Xian Computer Center Xian Communication Colledge Xian
    [J]. JournalofElectronics., 2004, (04) - 352
  • [3] AN IMPLEMENTATION OF FAST ALGORITHM FOR ELLIPTIC CURVE CRYPTOSYSTEM OVER GF(p)
    Lu Chen Chen Yanpu Bian Zhengzhong(Life Science Institute
    [J]. Journal of Electronics(China), 2004, (04) : 346 - 352
  • [4] A fast addition algorithm for elliptic curve arithmetic in GF(2n) using projective coordinates
    Higuchi, A
    Takagi, N
    [J]. INFORMATION PROCESSING LETTERS, 2000, 76 (03) : 101 - 103
  • [5] Improved algorithms for elliptic curve arithmetic in GF(2n)
    López, J
    Dahab, R
    [J]. SELECTED AREAS IN CRYPTOGRAPHY, 1999, 1556 : 201 - 212
  • [6] GF(2m) arithmetic modules for elliptic curve cryptography
    Morales-Sandoval, Miguel
    Feregrino-Uribe, Claudia
    [J]. RECONFIG 2006: PROCEEDINGS OF THE 2006 IEEE INTERNATIONAL CONFERENCE ON RECONFIGURABLE COMPUTING AND FPGA'S, 2006, : 176 - +
  • [7] Elliptic Curve GF(p) Point Multiplier by Dual Arithmetic Cores
    Wu, Tao
    [J]. PROCEEDINGS OF 2015 IEEE 11TH INTERNATIONAL CONFERENCE ON ASIC (ASICON), 2015,
  • [8] Fast RNS Implementation of Elliptic Curve Point Multiplication in GF(p) with Selected Base Pairs
    Mo, Yifeng
    Li, Shuguo
    [J]. 2017 27TH INTERNATIONAL CONFERENCE ON FIELD PROGRAMMABLE LOGIC AND APPLICATIONS (FPL), 2017,
  • [9] A fast parallel implementation of elliptic curve point multiplication over GF(2m)
    Rodríguez-Henríquez, F
    Saqib, NA
    Díaz-Pérez, A
    [J]. MICROPROCESSORS AND MICROSYSTEMS, 2004, 28 (5-6) : 329 - 339
  • [10] Fast arithmetic of elliptic curve cryptosystem in mobile communication
    Ya-Lin, M
    Liang, Z
    Zheng-Zhong, B
    Ying-Chun, G
    [J]. 2005 IEEE/ACES INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS AND APPLIED COMPUTATIONAL ELECTROMAGNETICS, 2005, : 1055 - 1059
12345