High performance of RSA simulation system based on modified montgomery algorithm
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 pr...
| Main Authors: | , , , , , |
|---|---|
| Format: | Conference Paper |
| Published: |
2016
|
| Online Access: | http://hdl.handle.net/20.500.11937/41341 |
| _version_ | 1848756118597140480 |
|---|---|
| author | Liu, J. Chen, G. Xiao, Z. Ma, S. Liu, Wan-Quan Zeng, W. |
| author_facet | Liu, J. Chen, G. Xiao, Z. Ma, S. Liu, Wan-Quan Zeng, W. |
| author_sort | Liu, J. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T09:07:07Z |
| format | Conference Paper |
| id | curtin-20.500.11937-41341 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T09:07:07Z |
| publishDate | 2016 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-413412017-09-13T14:14:27Z High performance of RSA simulation system based on modified montgomery algorithm Liu, J. Chen, G. Xiao, Z. Ma, S. Liu, Wan-Quan Zeng, W. 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. 2016 Conference Paper http://hdl.handle.net/20.500.11937/41341 10.1007/978-981-10-2663-8_42 restricted |
| spellingShingle | Liu, J. Chen, G. Xiao, Z. Ma, S. Liu, Wan-Quan Zeng, W. High performance of RSA simulation system based on modified montgomery algorithm |
| title | High performance of RSA simulation system based on modified montgomery algorithm |
| title_full | High performance of RSA simulation system based on modified montgomery algorithm |
| title_fullStr | High performance of RSA simulation system based on modified montgomery algorithm |
| title_full_unstemmed | High performance of RSA simulation system based on modified montgomery algorithm |
| title_short | High performance of RSA simulation system based on modified montgomery algorithm |
| title_sort | high performance of rsa simulation system based on modified montgomery algorithm |
| url | http://hdl.handle.net/20.500.11937/41341 |