An improved residue multiplier using Montgomery modular multiplication

被引:0
|
作者
Ahmadpour, Zabihollah [1 ]
机构
[1] Shahid Beheshti Univ, Dept Comp Sci & Engn, Tehran 1983963113, Iran
关键词
Residue number system; Generic residue multiplier; Montgomery multiplication; Differential power analysis attack; IMPLEMENTATION; ARCHITECTURES; NUMBER;
D O I
10.1016/j.micpro.2023.104853
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Implementing cryptosystems using the residue number system (RNS) requires many balanced equally-wide residue channels. The generic residue multiplier has a significant impact on the residue balance. Improving the residue multiplier delay affects the RNS efficiency. The Montgomery reduction is used for the residue gen-eration in the auto-scale multiplier method, where its operations are merged to reduce residue generation delay. The synthesis result shows the proposed work delay has improved by 36%, 41%, and 29% for three channel widths of 16, 32, and 64-bit compared to the previous relevant work. Moreover, the area consumption has reduced by about 40%.
引用
收藏
页数:5
相关论文
共 50 条
  • [41] 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,
  • [42] Implementation study of partly parallel Montgomery modular multiplier
    Liu, Qiang
    Tong, Dong
    Cheng, Xu
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2006, 34 (08): : 1537 - 1541
  • [43] High Radix Montgomery Modular Multiplier on Modern FPGA
    Wang, Pingjian
    Liu, Zongbin
    Wang, Lei
    Gao, Neng
    2013 12TH IEEE INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS (TRUSTCOM 2013), 2013, : 1484 - 1489
  • [44] Fault and Simple Power Attack Resistant RSA using Montgomery Modular Multiplication
    Fournaris, Apostolos P.
    2010 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, 2010, : 1875 - 1878
  • [45] Modified Montgomery modular multiplication using 4:2 compressor and CSA adder
    Thaphyal, H
    Ramasahayam, A
    Kotha, VR
    Gottimukkula, K
    Srinivas, MB
    DELTA 2006: THIRD IEEE INTERNATIONAL WORKSHOP ON ELECTRONIC DESIGN, TEST AND APPLICATIONS, 2006, : 414 - +
  • [46] An efficient signed digit montgomery modular multiplication algorithm
    Zhao, Shilei
    Huang, Hai
    Liu, Zhiwei
    Yu, Bin
    Yu, Bo
    MICROELECTRONICS JOURNAL, 2021, 114
  • [47] New Hardware Architectures for Montgomery Modular Multiplication Algorithm
    Huang, Miaoqing
    Gaj, Kris
    El-Ghazawi, Tarek
    IEEE TRANSACTIONS ON COMPUTERS, 2011, 60 (07) : 923 - 936
  • [48] Fast implementations of Montgomery's modular multiplication algorithm
    Mohan, PVA
    PROCEEDINGS OF THE 2003 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL IV: DIGITAL SIGNAL PROCESSING-COMPUTER AIDED NETWORK DESIGN-ADVANCED TECHNOLOGY, 2003, : 125 - 128
  • [49] Efficient and Scalable Hardware Implementation of Montgomery Modular Multiplication
    Issad, M.
    Anane, M.
    Boudraa, B.
    Bellemou, A. M.
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2022, 31 (08)
  • [50] Montgomery modular multiplication architecture for public key cryptosystems
    McLoone, M
    McIvor, C
    McCanny, J
    2004 IEEE WORKSHOP ON SIGNAL PROCESSING SYSTEMS DESIGN AND IMPLEMENTATION, PROCEEDINGS, 2004, : 349 - 354