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 条

[21] A VLSI architecture of fast high-radix modular multiplication for RSA cryptosystem
Wu, CH
Shieh, MD
Wu, CH
Sheu, MH
Sheu, JL
ISCAS '99: PROCEEDINGS OF THE 1999 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 1: VLSI, 1999, : 500 - 503
[22] VLSI architecture of fast high-radix modular multiplication for RSA cryptosystem
Wu, Che-Han
Shieh, Ming-Der
Wu, Chien-Hsing
Sheu, Ming-Hwa
Sheu, Jia-Lin
Proceedings - IEEE International Symposium on Circuits and Systems, 1999, 1
[23] A scalable architecture for modular multiplication based on Montgomery's algorithm
Tenca, AF
Koç, ÇK
IEEE TRANSACTIONS ON COMPUTERS, 2003, 52 (09) : 1215 - 1221
[24] 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
[25] A Prediction-Based Scalable Design for Montgomery Modular Multiplication
Chen, De-Sheng
Li, Huan-Teng
Wang, Yi-Wen
PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON ELECTRIC AND ELECTRONICS, 2013, : 46 - 50
[26] 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
[27] A new RSA encryption architecture and hardware implementation based on optimized Montgomery multiplication
Fournaris, AP
Koufopavlou, O
2005 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), VOLS 1-6, CONFERENCE PROCEEDINGS, 2005, : 4645 - 4648
[28] Efficient Design of Elliptic Curve Point Multiplication based on Fast Montgomery Modular Multiplication
Mohammadi, Maryam
Molahosseini, Amir Sabbagh
PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE 2013), 2013, : 424 - 429
[29] New and Improved Word-Based Unified and Scalable Architecture for Radix 2 Montgomery Modular Multiplication Algorithm
Ibrahim, Atef
Gebali, Fayez
Elsimary, Hamed
2013 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING (PACRIM), 2013, : 153 - 158
[30] Parameter Space for the Architecture of FFT-Based Montgomery Modular Multiplication
Chen, Donald Donglong
Yao, Gavin Xiaoxu
Cheung, Ray C. C.
Pao, Derek
Koc, Cetin Kaya
IEEE TRANSACTIONS ON COMPUTERS, 2016, 65 (01) : 147 - 160

← 1 2 3 4 5 →