Parallel High-Radix Montgomery Multipliers

被引:15
|
作者
Amberg, Philip [1 ]
Pinckney, Nathaniel [1 ]
Harris, David Money [1 ]
机构
[1] Harvey Mudd Coll, Claremont, CA 91711 USA
关键词
D O I
10.1109/ACSSC.2008.5074513
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper describes the algorithm and design tradeoffs for multiple hardware implementations of parallel high-radix scalable Montgomery multipliers. Hardware implementations of Montgomery multipliers require choosing a radix, shift direction, and whether to use Booth encoding. Presented are processing element designs exploring combinations of radices 2, 4, and 8, right vs. left shifting, and Booth encoding. A radix-4, left-shifting, non-Booth encoded design performs a 1024-bit modular exponentiation in 9.4 ms using 4997 LUTs and 4051 REGs and appears to maximize performance/hardware in an FPGA implementation. A Booth encoded version of the above multiplier performs a 1024-bit modular exponentiation in 13 ms using 4852 LUTs and 2887 REGs. This design may be beneficial for systems constrained by the cycle time of other elements because the design minimizes hardware usage and requires no precomputed multiples. The radix-8, right-shifting, Booth-encoded design offers no performance/hardware advantage over a comparable radix-4 design.
引用
收藏
页码:772 / 776
页数:5
相关论文
共 50 条
  • [21] High-Speed Montgomery Modular Multiplication Using High-Radix Systolic Multiplier
    Zhang Rui
    He Debiao
    Chen Jianhua
    Hu Jin
    [J]. PROCEEDINGS OF 2009 CONFERENCE ON COMMUNICATION FACULTY, 2009, : 265 - 268
  • [22] SPA against an FPGA-based RSA implementation with a high-radix montgomery multiplier
    Miyamoto, Atsushi
    Homma, Naofurni
    Aoki, Takafumi
    Satoht, Akashi
    [J]. 2007 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-11, 2007, : 1847 - +
  • [23] New RSA cryptosystem hardware implementation based on high-radix Montgomery's algorithm
    Fang, YL
    Gao, ZQ
    [J]. 2001 4TH INTERNATIONAL CONFERENCE ON ASIC PROCEEDINGS, 2001, : 348 - 351
  • [24] Majority Logic-based Approximate Recording Adders for High-radix Booth Multipliers
    Zhang, Tingting
    Jiang, Honglan
    Liu, Weiqiang
    Lombardi, Fabrizio
    Liu, Leibo
    Han, Jie
    [J]. 2022 IEEE 22ND INTERNATIONAL CONFERENCE ON NANOTECHNOLOGY (NANO), 2022, : 519 - 522
  • [25] A low-power high-radix serial-parallel multiplier
    Crookes, Danny
    Jiang, Richard M.
    [J]. 2007 EUROPEAN CONFERENCE ON CIRCUIT THEORY AND DESIGN, VOLS 1-3, 2007, : 460 - 463
  • [26] The Case for Disjoint Job Mapping on High-Radix Networked Parallel Computers
    Hu, Yao
    Koibuchi, Michihiro
    [J]. ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2021, PT II, 2022, 13156 : 123 - 143
  • [27] Parallelized Radix-4 Scalable Montgomery Multipliers
    Pinckney, Nathaniel
    Harris, David Money
    [J]. SBCCI2007: 20TH SYMPOSIUM ON INTEGRATED CIRCUITS AND SYSTEMS DESIGN, 2007, : 306 - 311
  • [28] Microarchitecture of a high-radix router
    Kim, J
    Dally, WJ
    Towles, B
    Gupta, AK
    [J]. 32ND INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, PROCEEDINGS, 2005, : 420 - 431
  • [29] High-radix logarithm with selection by rounding
    Piñeiro, JA
    Ercegovac, MD
    Bruguera, JD
    [J]. IEEE INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES, AND PROCESSORS, PROCEEDINGS, 2002, : 101 - 110
  • [30] Achieving High Throughput in High-Radix Switch
    Fang, Ming
    Chen, Songqiao
    Wang, Kefei
    [J]. TRUSTCOM 2011: 2011 INTERNATIONAL JOINT CONFERENCE OF IEEE TRUSTCOM-11/IEEE ICESS-11/FCST-11, 2011, : 1452 - 1456