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] 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,
  • [2] 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
  • [3] 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
  • [4] Low latency high throughput Montgomery modular multiplier for RSA cryptosystem
    Parihar, Aashish
    Nakhate, Sangeeta
    ENGINEERING SCIENCE AND TECHNOLOGY-AN INTERNATIONAL JOURNAL-JESTECH, 2022, 30
  • [5] A NEW RSA CRYPTOSYSTEM HARDWARE IMPLEMENTATION BASED ON MONTGOMERY'S ALGORITHM
    卢君明
    林争辉
    Journal of Shanghai Jiaotong University(Science), 2002, (01) : 46 - 49
  • [6] Area-Efficient Design of Modular Exponentiation Using Montgomery Multiplier for RSA Cryptosystem
    Nti, Richard Boateng
    Ryoo, Kwangki
    ADVANCED MULTIMEDIA AND UBIQUITOUS ENGINEERING, MUE/FUTURETECH 2018, 2019, 518 : 431 - 437
  • [7] 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
  • [8] Efficient FPGA implementation of modular multiplication based on Montgomery algorithm
    Yang, Yatao
    Wu, Chao
    Li, Zichen
    Yang, Junming
    MICROPROCESSORS AND MICROSYSTEMS, 2016, 47 : 209 - 215
  • [9] A TINY RSA COPROCESSOR BASED ON OPTIMIZED SYSTOLIC MONTGOMERY ARCHITECTURE
    Liu, Zongbin
    Xia, Luning
    Jing, Jiwu
    Liu, Peng
    SECRYPT 2011: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON SECURITY AND CRYPTOGRAPHY, 2011, : 105 - 113
  • [10] Very Fast Pipelined RSA Architecture Based on Montgomery's Algorithm
    Heri, Iput K.
    Bagja, Asep N.
    Purba, Randy S.
    Adiono, Trio
    2009 INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING AND INFORMATICS, VOLS 1 AND 2, 2009, : 479 - 483