An efficient CSA architecture for montgomery modular multiplication

被引：22
|
作者：
Zhang, Yuan-Yang [1 ]
Li, Zheng [1 ]
Yang, Lei [1 ]
Zhang, Shao-Wu [1 ]
机构：
[1] Informat Engn Univ, Inst Electron Technol, Zhengzhou 450004, Peoples R China
来源：
MICROPROCESSORS AND MICROSYSTEMS | 2007年 / 31卷 / 07期
关键词：
Montgomery algorithm; addition; CSA; FPGA;
D O I：
10.1016/j.micpro.2006.12.003
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Montgomery multipliers of carry save adder (CSA) architecture require a full addition to convert the carry save representation of the result into a conventional form. In this paper, we reuse the CSA architecture to perform the result format conversion, which leads to small area and fast speed. The results of implementation on FPGAs show that the new Montgomery multiplier is about 113.4 Mbit/s for 1024-bit operands at a clock of 114.2 MHz. (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：456 / 459
页数：4
相关论文
共 50 条
  • [31] Low-Cost High-Performance VLSI Architecture for Montgomery Modular Multiplication
    Kuang, Shiann-Rong
    Wu, Kun-Yi
    Lu, Ren-Yao
    [J]. IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2016, 24 (02) : 434 - 443
  • [32] The iterative structure analysis of Montgomery modular multiplication
    Jinbo, Wang
    [J]. NUMERICAL ANALYSIS AND APPLIED MATHEMATICS, 2007, 936 : 296 - 299
  • [33] New Processor Array Architecture for Scalable Radix 2 Montgomery Modular Multiplication Algorithm
    Ibrahim, Atef
    Gebali, Fayez
    Elsimary, Hamed
    Nassar, Amin
    [J]. 2009 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING, VOLS 1 AND 2, 2009, : 365 - 370
  • [34] NEW PROCESSOR ARRAY ARCHITECTURE FOR SCALABLE RADIX 8 MONTGOMERY MODULAR MULTIPLICATION ALGORITHM
    Ibrahim, Atef
    Gebali, Fayez
    Elsimary, Hamed
    Nassar, Amin
    [J]. 2011 24TH CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING (CCECE), 2011, : 389 - 394
  • [35] Fault Detection in RNS Montgomery Modular Multiplication
    Bajard, Jean-Claude
    Eynard, Julien
    Gandino, Filippo
    [J]. 2013 21ST IEEE SYMPOSIUM ON COMPUTER ARITHMETIC (ARITH), 2013, : 119 - 126
  • [36] New and improved architectures for Montgomery modular multiplication
    Sudhakar, M.
    Kamala, R. V.
    Srinivas, M. B.
    [J]. MOBILE NETWORKS & APPLICATIONS, 2007, 12 (04): : 281 - 291
  • [37] Modular multiplication in the Montgomery residue number system
    Phillips, B
    [J]. CONFERENCE RECORD OF THE THIRTY-FIFTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1 AND 2, 2001, : 1637 - 1640
  • [38] New and Improved Architectures for Montgomery Modular Multiplication
    M. Sudhakar
    R. V. Kamala
    M. B. Srinivas
    [J]. Mobile Networks and Applications, 2007, 12 : 281 - 291
  • [39] An Optimized Montgomery Modular Multiplication Algorithm for Cryptography
    Narmadha, G.
    Balasubadra, K.
    [J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2013, 13 (01): : 118 - 123
  • [40] High radix Montgomery Modular Multiplication on FPGA
    Mohamed, Anane
    Nadjia, Anane
    [J]. 2013 8TH INTERNATIONAL DESIGN AND TEST SYMPOSIUM (IDT), 2013,
12345