FPGA montgomery multiplier architectures - A comparison

被引:15
|
作者
McIvor, C [1 ]
McLoone, M [1 ]
McCanny, JV [1 ]
机构
[1] Queens Univ Belfast, Inst Elect Commun & Informat Technol, Belfast, Antrim, North Ireland
关键词
D O I
10.1109/FCCM.2004.36
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Novel FPGA architectures for the SOS, CIOS and FIOS Montgomery multiplication algorithms are presented. The 18x18-bit multipliers and fast carry look-ahead logic embedded within the Xilinx Virtex2 Pro family of FPGAs are used to perform the ordinary multiplications and additions required by these algorithms. A detailed analysis is given, highlighting the advantages and weaknesses of each of these architectures when implemented in hardware. This shows that the CIOS multiplier architectures perform best overall, with the performance gap between this and the other options increasing as the word size used decreases. In addition, the SOS multipliers outperform the FIOS multipliers for larger word sizes, but vice versa as the word size decreases. It is also shown that one can tailor the multiplier architectures to be area efficient, time efficient or a mixture of both, by choosing a particular word size.
引用
收藏
页码:279 / 282
页数:4
相关论文
共 50 条
  • [1] Efficient implementation of Montgomery modular multiplier on FPGA
    Abd-Elkader, Ahmed A. H.
    Rashdan, Mostafa
    Hasaneen, El-Sayed A. M.
    Hamed, Hesham F. A.
    [J]. COMPUTERS & ELECTRICAL ENGINEERING, 2022, 97
  • [2] Highly Optimized Montgomery Multiplier for SIKE Primes on FPGA
    Elkhatib, Rami
    Azarderakhsh, Reza
    Mozaffari-Kermani, Mehran
    [J]. 2020 IEEE 27TH SYMPOSIUM ON COMPUTER ARITHMETIC (ARITH), 2020, : 64 - 71
  • [3] High Radix Montgomery Modular Multiplier on Modern FPGA
    Wang, Pingjian
    Liu, Zongbin
    Wang, Lei
    Gao, Neng
    [J]. 2013 12TH IEEE INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS (TRUSTCOM 2013), 2013, : 1484 - 1489
  • [4] Montgomery modular multiplier architectures and hardware implementations for an RSA cryptosystem
    Fournaris, AP
    Koufopavlou, O
    [J]. Proceedings of the 46th IEEE International Midwest Symposium on Circuits & Systems, Vols 1-3, 2003, : 778 - 781
  • [5] Efficient RSA Crypto Processor Using Montgomery Multiplier in FPGA
    Gnanasekaran, Lavanya
    Eddin, Anas Salah
    El Naga, Halima
    El-Hadedy, Mohamed
    [J]. PROCEEDINGS OF THE FUTURE TECHNOLOGIES CONFERENCE (FTC) 2019, VOL 2, 2020, 1070 : 379 - 389
  • [6] FPGA Implementation of An Efficient Montgomery Multiplier For Adaptive Filtering Application
    Mulla, Nahed
    Kasetwar, Abhay
    [J]. 2014 INTERNATIONAL CONFERENCE ON POWER, AUTOMATION AND COMMUNICATION (INPAC), 2014, : 66 - 70
  • [7] Multiplier Architectures for FPGA Double Precision Functions
    Hamid, Y.
    Langhammer, Martin
    [J]. FPGA 10, 2010, : 287 - 287
  • [8] FPGA-Based Optimized Design of Montgomery Modular Multiplier
    Abd-Elkader, Ahmed A. H.
    Rashdan, Mostafa
    Hasaneen, El-Sayed A. M.
    Hamed, Hesham F. A.
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2021, 68 (06) : 2137 - 2141
  • [9] 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
  • [10] Uniform Montgomery multiplier
    Gokay Saldamli
    Yoo-Jin Baek
    [J]. Journal of Cryptographic Engineering, 2019, 9 : 333 - 339