Scalable montgomery multiplier for finite fields GF(p) and GF(2m)

被引：3
|
作者：
Kim, Tae Ho [1 ]
Kim, Sang Chul [2 ]
Kim, Chang Hoon [3 ]
Hong, Chun Pyo [2 ]
机构：
[1] Korea Adv Inst Sci & Technol, Mobile Media Platform Ctr, N-24 Bldg 373-1 Guseong Dong, Taejon 305701, South Korea
[2] Daegu Univ, Dept Comp & Commun Engn, Taegu 712714, South Korea
[3] Daegu Univ, Dept Comp & Informat Technol Engn, Taegu 712714, South Korea
来源：
DELTA 2008: FOURTH IEEE INTERNATIONAL SYMPOSIUM ON ELECTRONIC DESIGN, TEST AND APPLICATIONS, PROCEEDINGS | 2008年
关键词：
D O I：
10.1109/DELTA.2008.102
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper presents a scalable dual-field Montgomery multiplier based on a new multi-precision carry save adder (MP-CSA), which operates in both types of finite fields GF(p) and GF(2(m)). We also design a word-level adder for cryptographic applications by reusing the proposed multiplier circuit. The proposed Montgomery multiplier has roughly the same timing complexity and the advantage of reduced chip area requirements compared with the previous result.
引用
收藏
页码：458 / +
页数：2
相关论文
共 50 条
  • [1] A scalable and unified multiplier architecture for finite fields GF(p) and GF(2m)
    Savas, E
    Tenca, AF
    Koç, ÇK
    [J]. CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS-CHES 2000, PROCEEDINGS, 2001, 1965 : 277 - 292
  • [2] Montgomery multiplier and squarer in GF(2m)
    Wu, HP
    [J]. CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS-CHES 2000, PROCEEDINGS, 2001, 1965 : 264 - 276
  • [3] Scalable and systolic Montgomery multiplier over GF(2m) generated by trinomials
    Lee, C. -Y.
    Chiou, C. W.
    Lin, J. -M.
    Chang, C. -C.
    [J]. IET CIRCUITS DEVICES & SYSTEMS, 2007, 1 (06) : 477 - 484
  • [4] Pipelined systolic multiplier for finite fields GF(2m)
    Kim, HS
    Yoo, KY
    Kim, JJ
    Kim, TG
    [J]. INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, PROCEEDINGS, 1999, : 1224 - 1229
  • [5] An efficient Systolic multiplier for finite fields GF(2m)
    Kim, CH
    Han, SD
    Hong, CP
    [J]. PDPTA'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, 2001, : 1366 - 1371
  • [6] A Hardware Pipelined Architecture of a Scalable Montgomery Modular Multiplier over GF(2m)
    Reymond, Guillaume
    Murillo, Victor
    [J]. 2013 INTERNATIONAL CONFERENCE ON RECONFIGURABLE COMPUTING AND FPGAS (RECONFIG), 2013,
  • [7] A fast kernel for unifying GF(p) and GF(2m) montgomery multiplications in a scalable pipelined architecture
    Satzoda, Ravi Kumar
    Chang, Chip-Hong
    [J]. 2006 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-11, PROCEEDINGS, 2006, : 3378 - +
  • [8] An FPGA implementation of a Montgomery multiplier over GF(2M)
    Mentens, N
    Örs, SB
    Preneel, B
    Vandewalle, J
    [J]. COMPUTING AND INFORMATICS, 2004, 23 (5-6) : 487 - 499
  • [9] LFSR Based Low Complexity Montgomery Multiplier in GF(2m) for A Class of Fields
    Mahmoud, Walid M.
    Liu, Bingxin
    Asif, Raqib A.
    Wu, Huapeng
    [J]. 2014 IEEE 27TH CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING (CCECE), 2014,
  • [10] Efficient Bit-Serial Finite Field Montgomery Multiplier in GF(2m)
    Wu, Huapeng
    [J]. 2014 4TH IEEE INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND TECHNOLOGY (ICIST), 2014, : 527 - 530
12345