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 条
  • [1] Early-Word-Based Montgomery Modular Multiplication Algorithm
    Verma, Rupali
    Dutta, Maitreyee
    Vig, Renu
    2ND INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND INTEGRATED NETWORKS (SPIN) 2015, 2015, : 595 - 600
  • [2] A new Montgomery modular multiplication algorithm and its VLSI design for RSA cryptosystem
    Chen, Jun-Hong
    Wu, Haw-Shiuan
    Shieh, Ming-Der
    Lin, Wen-Ching
    2007 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-11, 2007, : 3780 - 3783
  • [3] FPGA Implementation of RSA based on Carry Save Montgomery Modular Multiplication
    Verma, Rupali
    Dutta, Maitreyee
    Vig, Renu
    2016 INTERNATIONAL CONFERENCE ON COMPUTATIONAL TECHNIQUES IN INFORMATION AND COMMUNICATION TECHNOLOGIES (ICCTICT), 2016,
  • [4] CRT RSA Decryption: Modular Exponentiation based solely on Montgomery Multiplication
    Carlos Neto, Joao
    Tenca, Alexandre Ferreira
    Ruggiero, Wilson Vicente
    2015 49TH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, 2015, : 431 - 436
  • [5] RSA Cryptosystem with Modified Montgomery Modular Multiplier
    Mahapatra, Priyanka Priyadarsini
    Agrawal, Sonali
    2017 IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND COMPUTING RESEARCH (ICCIC), 2017, : 75 - 80
  • [6] Modular Multiplication and Exponentiation Architectures for Fast RSA Cryptosystem Based on Digit Serial Computation
    Sutter, Gustavo D.
    Deschamps, Jean-Pierre
    Luis Imana, Jose
    IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 2011, 58 (07) : 3101 - 3109
  • [7] Montgomery modular multiplier architectures and hardware implementations for an RSA cryptosystem
    Fournaris, AP
    Koufopavlou, O
    Proceedings of the 46th IEEE International Midwest Symposium on Circuits & Systems, Vols 1-3, 2003, : 778 - 781
  • [8] Modified Montgomery modular multiplication and RSA exponentiation techniques
    McIvor, C
    McLoone, M
    McCanny, JV
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2004, 151 (06): : 402 - 408
  • [9] A faster modular multiplication based on key size partitioning for RSA public-key cryptosystem
    Lee, SY
    Jeong, YJ
    Kwon, OJ
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2002, E85D (04) : 789 - 791
  • [10] High-speed modular multiplication algorithm for RSA cryptosystem
    Cho, KS
    Ryu, JH
    Cho, JD
    IECON'01: 27TH ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY, VOLS 1-3, 2001, : 479 - 483