A High-Performance RSA Coprocessor Based on Half-Carry-Save and Dual-Core MAC Architecture

DING Yanyu; HU Jianguo; WANG Deming; TAN Hongzhou

doi:10.1049/cje.2017.11.013

Volume 27 Issue 1

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Electronics > 2018 > 27(1): 70-75

DING Yanyu, HU Jianguo, WANG Deming, et al., “A High-Performance RSA Coprocessor Based on Half-Carry-Save and Dual-Core MAC Architecture,” Chinese Journal of Electronics, vol. 27, no. 1, pp. 70-75, 2018, doi: 10.1049/cje.2017.11.013

Citation:

DING Yanyu, HU Jianguo, WANG Deming, et al., “A High-Performance RSA Coprocessor Based on Half-Carry-Save and Dual-Core MAC Architecture,” Chinese Journal of Electronics, vol. 27, no. 1, pp. 70-75, 2018, doi: 10.1049/cje.2017.11.013

Citation:

PDF( 323 KB)

A High-Performance RSA Coprocessor Based on Half-Carry-Save and Dual-Core MAC Architecture

doi: 10.1049/cje.2017.11.013

School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510006, China

Funds: This work was supported by National Natural Science Foundation of China (No.61402546).

More Information

Corresponding author: HU Jianguo (corresponding author) received Ph.D. degree in communication and information systems from Sun Yat-sen University, in 2010. He is a senior engineer of Sun Yat-sen University. His current research interests include integrated circuit, the Internet of things technology and application, smart city technology and application, embedded system. (Email:hujguo@mail.sysu.edu.cn)
Received Date: 2015-11-18
Rev Recd Date: 2015-11-18
Publish Date: 2018-01-10

Abstract

Abstract

This research focuses on the methods to improve the throughput and lower the power for low cost RSA coprocessors. We proposed the following optimized methods:1. A fast half-carry-save Montgomery modular multiplication algorithm suitable for hardware implementation; 2. A high-speed dual-core multiplier accumulator architecture to optimize the critical path; 3. Several lowpower optimization schemes for the RSA coprocessor. The design has been implemented with TSMC 90nm technology, and the experimental results show that the critical path is 2.71ns, the power consumption is just 9.76mW and the throughput can reach 381.57kbps. Compared with relative works, our design is featured by the minimal power and the best overall performance, thus it is most suitable for applications in low-power systems.
- RSA coprocessor,
- Montgomery multiplication,
- Half-carry-save,
- Dual-core MAC

FullText(HTML)

References(16)

References

A. Miyamoto, N. Homma, T. Aoki, et al., "Systematic design of RSA processors based on high-radix montgomery multipliers", IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Vol.19, No.7, pp.1136-1146, 2011.

M. Knezevic, F. Vercauteren and I. Verbauwhede, "Faster interleaved modular multiplication based on Barrett and Montgomery reduction methods", IEEE Transactions on Computers, Vol.59, No.12, pp.1715-1721, 2010.

A.P. Renardy, N. Ahmadi, A.A. Fadila, et al., "Hardware implementation of montgomery modular multiplication algorithm using iterative architecture", 2015 International Seminar on Intelligent Technology and Its Applications (ISITIA), Surabaya, Indonesia, pp.99-102, 2015.

A. Nadjia and A. Mohamed, "High throughput parallel montgomery modular exponentiation on FPGA", 20149th International Conference on Design & Test Symposium (IDT), Algeries, Algeria, pp.225-230, 2014.

L. Wen-Ching, Y. Jheng-Hao and S. Ming-Der, "Scalable montgomery modular multiplication architecture with low-latency and low-memory bandwidth requirement", IEEE Transactions on Computers, Vol.63, No.2, pp.475-483, 2014.

S.H. Wang, W.C. Lin, J.H. Ye, et al., "Fast scalable radix-4 montgomery modular multiplier", 2012 IEEE International Symposium on Circuits and Systems (ISCAS), Seoul, South Korea, pp.3049-3052, 2012.

M.H. Huang, K. Gaj and T. El-Ghazawi, "New hardware architectures for montgomery modular multiplication algorithm", IEEE Transactions on Computers, Vol.60, No.7, pp.923-936, 2011.

M.-D. Shieh and W.-C. Lin, "Word-based montgomery modular multiplication algorithm for low-latency scalable architectures", IEEE Transactions on Computers, Vol.59, No.8, pp.1145-1151, 2010.

G. Perin, D.G. Mesquita, F.L. Herrmann, et al., "Montgomery modular multiplication on reconfigurable hardware:fully systolic array versus parallel implementation", 2010 VI Southern Programmable Logic Conference (SPL), Ipojuca, Porto de Galinhas Beach, BRAZIL, pp.61-66, 2010.

S. Ming-Der, C. Jun-Hong, L. Wen-Ching, et al., "A new algorithm for high-speed modular multiplication design", IEEE Transactions on Circuits and Systems I:Regular Papers, Vol.56, No.9, pp.2009-2019, 2009.

R. Verma, M. Dutta and R. Vig, "Early-word-based montgomery modular multiplication algorithm", 20152nd International Conference on Signal Processing and Integrated Networks (SPIN), Noida, Delhi-NCR, India, pp.595-600, 2015.

K. Shiann-Rong, W. Jiun-Ping and C. Kai-Cheng, et al., "Energy-efficient high-throughput montgomery modular multipliers for RSA cryptosystems", IEEE Transactions on Very Large Scale Integration (Vlsi) Systems, Vol.21, No.11, pp.1999-2009, 2013.

C.A. da Costa, R.L. Moreno, O.S.A. Carpinteiro, et al., "A 1024 bit RSA coprocessor in CMOS", 201325th International Conference on Microelectronics (ICM), Beirut, Lebanon, pp.1-4, 2013.

D.M. Wang, Y.Y. Ding, J.G. Hu, et al., "Low power hardware design for montgomery modular multiplication", IET International Conference on Information and Communications Technologies (IETICT 2013), Beijing, China, pp.124-128, 2013.

D.M. Wang, Y.Y. Ding, J. Zhang, et al., "Area-efficient and ultra-low-power architecture of RSA processor for RFID", Electronics Letters, Vol.48, No.19, pp.1185-U1131, 2012.

L. Chen, W.Z. Sun, X.Y. Chen et al., "Montgomery modular inversion algorithm based on signed digit system and hardware implementation", Acta Electronica Sinica, Vol.40, No.3, pp.489-494, 2012. (In Chinese)

Relative Articles

Supplements(0)

Cited By

Proportional views