Montgomery multiplication in GF(2k)

被引：0
|
作者：
机构：
来源：
Des Codes Cryptography | / 1卷 / 57-69期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [11] Efficient VLSI Implementation for Montgomery Multiplication in GF(2(m))
    Chiou, Che-Wun
    Lee, Chiou-Yng
    Deng, An-Wen
    Lin, Jim-Min
    JOURNAL OF APPLIED SCIENCE AND ENGINEERING, 2006, 9 (04): : 365 - 372
  • [12] Look-up table-based Montgomery algorithm in GF(2k) for public-key cryptosystem
    Kim, NY
    Yoo, KY
    COMPUTERS AND THEIR APPLICATIONS, 2003, : 9 - 12
  • [13] Comparing design approaches for elliptic curve point multiplication over GF(2k) with polynomial basis representation
    Fournaris, Apostolos P.
    Zafeirakis, Ioannis
    Kitsos, Paris
    Koufopavlou, Odysseas
    MICROPROCESSORS AND MICROSYSTEMS, 2015, 39 (08) : 1139 - 1155
  • [14] GF(2n) Montgomery Multiplication using Polynomial Residue Arithmetic
    Schinianakis, Dimitrios
    Skavantzos, Alexander
    Stouraitis, Thanos
    2012 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS 2012), 2012,
  • [15] A unified, reconfigurable architecture for Montgomery multiplication in finite fields GF(p) and GF(2n)
    Sudhakar, M.
    Kamala, R. V.
    Srinivas, M. B.
    20TH INTERNATIONAL CONFERENCE ON VLSI DESIGN, PROCEEDINGS: TECHNOLOGY CHALLENGES IN THE NANOELECTRONICS ERA, 2007, : 750 - +
  • [16] Concurrent error detection in Montgomery multiplication over GF(2m)
    Chiou, CW
    Lee, CY
    Deng, AW
    Lin, JM
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2006, E89A (02) : 566 - 574
  • [17] Unified dual-field multiplier in GF(P) and GF(2k)
    Chiou, C. W.
    Lee, C-Y
    Lin, J. -M.
    IET INFORMATION SECURITY, 2009, 3 (02) : 45 - 52
  • [18] Optimized GF(2k) ONB Type I Multiplier architecture based on the Massey-Omura Multiplication pattern
    Fournaris, AP
    Koufopavlou, O
    SECOND CONFERENCE ON MICROELECTRONICS, MICROSYSTEMS AND NANOTECHNOLOGY, 2005, 10 : 381 - 384
  • [19] Scalable unified dual-radix architecture for Montgomery multiplication in GF(P) and GF(2n)
    Tanimura, Kazuyuki
    Nara, Ryuta
    Kohara, Shunitsu
    Shimizu, Kazunori
    Shi, Youhua
    Togawa, Nozomu
    Yanagisawa, Masao
    Ohtsuki, Tatsuo
    2008 ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2, 2008, : 667 - 672
  • [20] Parallel montgomery multiplication and squaring over GF(2m) based on cellular automata
    Ku, Kyo Min
    Ha, Kyeoung Ju
    Yoo, Wi Hyun
    Yoo, Kee Young
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 3046 LNCS (PART 4): : 196 - 205
12345