Montgomery multiplication in GF(2k)

被引：0
|
作者：
机构：
来源：
Des Codes Cryptography | / 1卷 / 57-69期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Montgomery Multiplication in GF(2k)
    Koç Ç.K.
    Acar T.
    Designs, Codes and Cryptography, 1998, 14 (1) : 57 - 69
  • [2] Montgomery multiplication and squaring algorithms in GF(2k)
    Kim, NY
    Yoo, KY
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2003, PT 1, PROCEEDINGS, 2003, 2667 : 865 - 874
  • [3] GF(2K) multipliers based on montgomery multiplication algorithm
    Fournaris, AP
    Koufopavlou, O
    2004 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 2, PROCEEDINGS, 2004, : 849 - 852
  • [4] Parallel montgomery multiplication in GF(2k) using trinomial residue arithmetic
    Bajard, JC
    Imbert, L
    Jullien, GA
    17TH IEEE SYMPOSIUM ON COMPUTER ARITHMETIC, PROCEEDINGS, 2005, : 164 - 171
  • [5] Versatile multiplier architectures in GF(2k) fields using the Montgomery multiplication algorithm
    Fournaris, Apostolos P.
    Koufopavlou, O.
    INTEGRATION-THE VLSI JOURNAL, 2008, 41 (03) : 371 - 384
  • [6] Montgomery residue representation fault-tolerant computation in GF(2k)
    Medos, Silvana
    Boztas, Serdar
    INFORMATION SECURITY AND PRIVACY, 2008, 5107 : 419 - 432
  • [7] On Montgomery-like representations for elliptic curves over GF(2k)
    Stam, M
    PUBLIC KEY CRYPTOGRAPHY - PKC 2003, PROCEEDINGS, 2003, 2567 : 240 - 253
  • [8] Parallel Multiplication in GF(2k) using Polynomial Residue Arithmetic
    A. Halbutogullari
    C. K. Koc
    Designs, Codes and Cryptography, 2000, 20 : 155 - 173
  • [9] Parallel multiplication in GF(2k) using polynomial residue arithmetic
    Halbutogullari, A
    Koc, ÇK
    DESIGNS CODES AND CRYPTOGRAPHY, 2000, 20 (02) : 155 - 173
  • [10] Parallelized Montgomery Exponentiation in GF(2k) for Diffie-Hellman Key Exchange Protocol
    Krikun, Alexander
    Levina, Alla
    ENGINEERING LETTERS, 2021, 29 (02) : 645 - 649
12345