RSA Cryptosystem Based on Early Word Based Montgomery Modular Multiplication

被引：3

作者：

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 条

[21] 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)
[22] A High-Performance and Low-Cost Montgomery Modular Multiplication Based on Redundant Binary Representation
Li, Bing
Wang, Jinlei
Ding, Guocheng
Fu, Haisheng
Lei, Bingjie
Yang, Haitao
Bi, Jiangang
Lei, Shaochong
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2021, 68 (07) : 2660 - 2664
[23] DCSA systolic array for modular multiplication and RSA encryption
Zhang, CN
Li, H
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, 2000, : 1667 - 1673
[24] VLSI array algorithms and architectures for RSA modular multiplication
Jeong, YJ
Burleson, WP
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 1997, 5 (02) : 211 - 217
[25] VLSI design of RSA cryptosystem based on the Chinese remainder theorem
Wu, CH
Hong, JH
Wu, CW
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2001, 17 (06) : 967 - 979
[26] Modified RSA Cryptosystem Based on Offline Storage and Prime Number
Patidar, Ritu
Bhartiya, Rupali
2013 IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND COMPUTING RESEARCH (ICCIC), 2013, : 285 - 290
[27] A fast bit-interleaving RSA cryptosystem based on radix-4 cellular-array modular multiplier
Hong, Din-Hua
Tsai, Bin-Yan
2006 IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS, 2006, : 1446 - +
[28] Efficient Interleaved Modular Multiplication Based on Sign Detection
Nassar, Mohamed A.
El-Sayed, Layla A. A.
2015 IEEE/ACS 12TH INTERNATIONAL CONFERENCE OF COMPUTER SYSTEMS AND APPLICATIONS (AICCSA), 2015,
[29] Known-Plaintext-Only Attack on RSA-CRT with Montgomery Multiplication
Hlavac, Martin
CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2009, PROCEEDINGS, 2009, 5747 : 128 - 140
[30] An Improved Montgomery Modular Multiplication Algorithm and Its Hardware Implementation
Ren S.
Wang H.
Hao Y.
Xue C.
Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology, 2024, 44 (03): : 306 - 311

← 1 2 3 4 5 →