High performance of RSA simulation system based on modified montgomery algorithm

Liu, J.; Chen, G.; Xiao, Z.; Ma, S.; Liu, Wan-Quan; Zeng, W.

doi:10.1007/978-981-10-2663-8_42

Access Status

Fulltext not available

Authors

Liu, J.

Chen, G.

Xiao, Z.

Ma, S.

Liu, Wan-Quan

Zeng, W.

Date

2016

Type

Conference Paper

Metadata

Show full item record

Citation

Liu, J. and Chen, G. and Xiao, Z. and Ma, S. and Liu, W. and Zeng, W. 2016. High performance of RSA simulation system based on modified montgomery algorithm, in Proceedings of the 16th Asia Simulation Conference and SCS Autumn Simulation Multi-Conference, AsiaSim/SCS AutumnSim 2016: Theory, Methodology, Tools and Applications for Modeling and Simulation of Complex Systems, Oct 8-11 2016, pp. 398-408. Bejing, China: Springer.

Source Title

Communications in Computer and Information Science

DOI

10.1007/978-981-10-2663-8_42

ISBN

9789811026621

School

Department of Computing

URI

http://hdl.handle.net/20.500.11937/41341

Collection

Curtin Research Publications

Abstract

In order to eliminate the effect of the factor R-1 and decrease the number of iteration of modular exponentiation algorithm, a high performance scalable of Right-to-Left scan public-key cipher RSA simulation system is proposed. An advanced high radix Montgomery modular multiplication algorithm is presented to calculate by using an adder and a shift register, and the complexity of the circuit is minimized. The computation kernel of the device is two 32 bits multipliers with pipelining architecture, and it operates concurrently. The result of the hardware implementation shows that the improved RSA coprocessor is synthesized by CSMC 0.18um library, the area optimization design of 42 k gates with 213 ms/RSA are obtained to complete a 1024 bits encryption at 10 MHz. Compared with previous works, the proposed architecture can achieve better performance for the chip area and speed.