RSA Cryptosystem Based on Early Word Based Montgomery Modular Multiplication

被引:2
|
作者
Verma, Rupali [1 ]
Dutta, Maitreyee [2 ]
Vig, Renu [3 ]
机构
[1] Punjab Engn Coll, Chandigarh, India
[2] NITTTR, Chandigarh, India
[3] Panjab Univ, UIET, Chandigarh, India
来源
SERVICES - SERVICES 2018 | 2018年 / 10975卷
关键词
Early word based; FPGA; Montgomery; RSA; EXPONENTIATION ARCHITECTURE;
D O I
10.1007/978-3-319-94472-2_3
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
RSA is a public key cryptosystem in which encryption and decryption are modular exponentiation functions. Modular exponentiation is achieved by repeated modular multiplications. Montgomery modular multiplication is an efficient algorithm, hence is widely used for RSA public key cryptosystem. Performance of RSA depends on throughput of Montgomery modular multiplication. This paper presents RSA with Early Word based Montgomery modular multiplication. Early word based approach is scalable and Radix 4 Early Word Based Common Multiplicand Montgomery is proposed. RSA cryptosystem is implemented on virtex 5 FPGAs. The processing elements in Early Word based Montgomery use target device resources DSP48E for addition of operands. Two factors: algorithmic approach and use of target device resources have improved the performance of RSA on FPGAs.
引用
收藏
页码:33 / 47
页数:15
相关论文
共 50 条
  • [31] Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods
    Knezevic, Miroslav
    Vercauteren, Frederik
    Verbauwhede, Ingrid
    IEEE TRANSACTIONS ON COMPUTERS, 2010, 59 (12) : 1715 - 1721
  • [32] Efficient interleaved Montgomery modular multiplication for lattice-based cryptography
    Akleylek, Sedat
    Tok, Zaliha Yuce
    IEICE ELECTRONICS EXPRESS, 2014, 11 (22):
  • [33] New RSA cryptosystem hardware implementation based on high-radix Montgomery's algorithm
    Fang, YL
    Gao, ZQ
    2001 4TH INTERNATIONAL CONFERENCE ON ASIC PROCEEDINGS, 2001, : 348 - 351
  • [34] A 1024-bit RSA cryptosystem hardware design based on modified Montgomery's algorithm
    Gong, PJ
    Guo, L
    Bai, XF
    2003 5TH INTERNATIONAL CONFERENCE ON ASIC, VOLS 1 AND 2, PROCEEDINGS, 2003, : 1296 - 1299
  • [35] Optical asymmetric JTC cryptosystem based on multiplication-division operation and RSA algorithm
    Liu, Yijie
    Shen, Xueju
    Liu, Jie
    Peng, Kaifei
    OPTICS AND LASER TECHNOLOGY, 2023, 160
  • [36] Modular Arithmetic Analyses for RSA Cryptosystem
    Wu, Chia-Long
    Hu, Chen-Hao
    2014 INTERNATIONAL SYMPOSIUM ON COMPUTER, CONSUMER AND CONTROL (IS3C 2014), 2014, : 816 - 819
  • [37] A Division-Free Toom-Cook Multiplication-Based Montgomery Modular Multiplication
    Gu, Zhen
    Li, Shuguo
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2019, 66 (08) : 1401 - 1405
  • [38] An efficient signed digit montgomery multiplication for RSA
    Lim, Daesung
    Chang, Nam Su
    Ji, Sung Yeon
    Kim, Chang Han
    Lee, Sangjin
    Park, Young-Ho
    JOURNAL OF SYSTEMS ARCHITECTURE, 2009, 55 (7-9) : 355 - 362
  • [39] FPGA Implementation of Modified Serial Montgomery Modular Multiplication for 2048-bit RSA Cryptosystems
    Hanindhito, Bagus
    Ahmadi, Nur
    Hogantara, Hafez
    Arrahmah, Annisa I.
    Adiono, Trio
    2015 INTERNATIONAL SEMINAR ON INTELLIGENT TECHNOLOGY AND ITS APPLICATIONS (ISITIA), 2015, : 113 - 117
  • [40] FPGA-based high-throughput Montgomery modular multipliers for RSA cryptosystems
    Xiao, Hao
    Yu, Sijia
    Cheng, Biqian
    Liu, Guangzhu
    IEICE ELECTRONICS EXPRESS, 2022, 19 (09):